Decompositions of complete graphs into triangles and Hamilton cycles

DOI10.1002/JCD.10063zbMATH Open1042.05079OpenAlexW2154485928MaRDI QIDQ4736764FDOQ4736764

Authors: Darryn Bryant, Barbara Maenhaut 

Publication date: 6 August 2004

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.10063

Recommendations

• Decomposition of complete graphs into paths of length three and triangles.
• Decomposition of complete graphs into triangles and claws
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Cycle decompositions. V: Complete graphs into cycles of arbitrary lengths
• Hamilton surfaces for the complete symmetric tripartite graph

zbMATH Keywords

graph decompositionHamilton cycleSteiner triple systems

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Triple systems (05B07)

Cited In (21)

• Decompositions of complete multigraphs into cycles of varying lengths
• Symmetric Hamilton cycle decompositions of complete graphs minus a 1-factor
• On Hamilton decompositions of line graphs of non-Hamiltonian graphs and graphs without separating transitions
• The spectrum for quasigroups with cyclic automorphisms and additional symmetries.
• Hamilton surfaces for the complete symmetric tripartite graph
• Decompositions into 2-regular subgraphs and equitable partial cycle decompositions
• Cycle decompositions of complete multigraphs
• Decomposing graphs into edges and triangles
• Decompositions of triangle-dense graphs
• Triangle decompositions of \(\lambda K_v - \lambda K_w - \lambda K_u\)
• On Complete (s,t)-Cycle Systems of Complete Graphs
• An asymptotic solution to the cycle decomposition problem for complete graphs
• Decomposition of complete graphs into cycles and stars
• Lower bounds on the size of maximum independent sets and matchings in hypergraphs of rank three
• Packing cycles in complete graphs
• Title not available (Why is that?)
• Hamiltonian decompositions of complete graphs
• 3-Perfect hamiltonian decomposition of the complete graph
• Decomposition of complete graphs into triangles and claws
• Twofold triple systems without 2-intersecting Gray codes
• Decomposition of complete graphs into paths of length three and triangles.

This page was built for publication: Decompositions of complete graphs into triangles and Hamilton cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4736764)