Hamilton cycle rich two-factorizations of complete graphs

DOI10.1002/JCD.20005MaRDI QIDQ4458740zbMATH OpenOpenAlexWikidataFDO

Authors Darryn Bryant

Publication date 15 March 2004

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

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

zbMATH Keywords

graph decompositiongraph factorization2-factorizationHamilton cycle decomposition

Mathematics Subject Classification ID

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

Recommendations

• Hamilton cycle rich 2-factorizations of complete multipartite graphs
• Hamilton cycle rich 2-factorization of complete bipartite graphs
• Hamilton cycle rich 2-factorization of complete equipartite graphs. II
• scientific article; zbMATH DE number 1556749
• scientific article; zbMATH DE number 1286743

Cites work

• Hamilton decomposable graphs with specified leaves

Cited in

(27)

• The Hamilton-Waterloo problem: The case of triangle-factors and one Hamilton cycle
• Decompositions of complete multigraphs into cycles of varying lengths
• Enclosings of \(\lambda\)-fold 5-cycle systems for \(u = 2\)
• On the Hamilton-Waterloo problem for bipartite 2-factors
• Hamilton decompositions of balanced complete multipartite graphs with primitive leaves
• Hamilton decompositions of graphs with primitive complements
• scientific article; zbMATH DE number 2147950 (Why is no real title available?)
• Hamilton cycle rich 2-factorizations of complete multipartite graphs
• Neighborhoods in maximum packings of 2K_n and quadratic leaves of triple systems
• Multiply balanced edge colorings of multigraphs
• Fair 1-factorizations and fair holey 1-factorizations of complete multipartite graphs
• scientific article; zbMATH DE number 1760765 (Why is no real title available?)
• A survey on constructive methods for the Oberwolfach problem and its variants
• On the generalized Oberwolfach problem
• Hamilton cycle rich 2-factorization of complete equipartite graphs. II
• scientific article; zbMATH DE number 3896976 (Why is no real title available?)
• scientific article; zbMATH DE number 1512681 (Why is no real title available?)
• Hamilton cycle rich 2-factorization of complete bipartite graphs
• Fair and internally fair (holey) Hamiltonian decompositions of \(K(n_0, \ldots, n_{p - 1}; \lambda_1, \lambda_2)\)
• 4-cycle systems of \(K_n-E(F^\ast)\)
• Some observations on the oberwolfach problem
• Maximal sets of 2-factors and Hamiltonian cycles
• All graphs with maximum degree three whose complements have 4-cycle decompositions
• 2-factors and Hamiltonicity
• Enclosings of decompositions of complete multigraphs in 2-factorizations
• Fair holey Hamiltonian decompositions of complete multipartite graphs and long cycle frames
• On 2-factorizations of the complete graph: From thek-pyramidal to the universal property

This page was built for publication: Hamilton cycle rich two-factorizations of complete graphs

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