Hamilton decompositions of graphs with primitive complements

DOI10.1016/J.DISC.2008.07.026MaRDI QIDQ1044964zbMATH OpenOpenAlexFDO

Authors C. A. Rodger, Sibel Özkan

Publication date 15 December 2009

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2008.07.026

zbMATH Keywords

graph decompositionsHamilton cyclesprimitive graphs

Mathematics Subject Classification ID

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

Recommendations

• Hamilton decompositions of balanced complete multipartite graphs with primitive leaves
• Hamilton decomposable graphs with specified leaves
• Hamilton decompositions of line graphs of some bipartite graphs
• scientific article; zbMATH DE number 825148
• Hamilton decompositions of complete graphs with a 3-factor leave.

Cites work

• Canonical edge-colourings of locally finite graphs
• Graph theory
• Hamilton cycle rich two-factorizations of complete graphs
• Hamilton decomposable graphs with specified leaves
• Hamilton decompositions of complete graphs with a 3-factor leave.
• Hamiltonian decompositions of complete graphs
• Maximal sets of 2-factors and Hamiltonian cycles
• Maximal sets of Hamilton cycles in \(K_{2p}-F\)
• Maximal sets of Hamilton cycles in complete multipartite graphs. II.
• On the Hamilton-Waterloo problem
• The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors

Cited in

(2)

• Hamiltonicity of a coprime graph
• Hamilton decompositions of balanced complete multipartite graphs with primitive leaves

This page was built for publication: Hamilton decompositions of graphs with primitive complements

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