Affordable Access

Publisher Website

Decomposing complete tripartite graphs into cycles of lengths 3 and 4

Authors
Journal
Discrete Mathematics
0012-365X
Publisher
Elsevier
Publication Date
Identifiers
DOI: 10.1016/s0012-365x(99)90049-3
Keywords
  • Graph Decomposition
  • Complete Tripartite Graph
  • Cycle System

Abstract

Abstract Necessary and sufficient conditions are given for the edge-disjoint decomposition of a complete tripartite graph K r, s, t into exactly α 3-cycles and β 4-cycles.

There are no comments yet on this publication. Be the first to share your thoughts.