DECOMPOSITIONS OF GENERALIZED COMPLETE GRAPHS

DOI10.1017/S0004972709000793zbMath1218.05150MaRDI QIDQ3651096

Benjamin R. Smith

Publication date: 8 December 2009

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

graph decompositiongeneralized complete graphgregarious k-cycle decompositionk-cycle decomposition

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• Balanced incomplete block designs and related designs
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• \(C_{p}\)-decompositions of some regular graphs
• Cycle decompositions III: Complete graphs and fixed length cycles

This page was built for publication: DECOMPOSITIONS OF GENERALIZED COMPLETE GRAPHS