Hamilton decompositions of balanced complete multipartite graphs with primitive leaves

DOI10.1016/j.disc.2010.03.006zbMath1222.05142OpenAlexW1971058100MaRDI QIDQ973125

C. A. Rodger, Sibel Özkan

Publication date: 28 May 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Hamilton cycleprimitivemaximalamalgamations

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamilton decomposable graphs with specified leaves
• Conditions for sequences to be r-graphic
• Hamiltonian decompositions of complete graphs
• Maximal sets of Hamilton cycles in \(K_{2p}-F\)
• Hamilton decompositions of graphs with primitive complements
• Canonical edge-colourings of locally finite graphs
• Graph factors
• Maximal sets of 2-factors and Hamiltonian cycles
• On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
• On the Hamilton-Waterloo problem
• Hamilton decompositions of complete graphs with a 3-factor leave.
• The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors
• Hamilton cycle rich two-factorizations of complete graphs

This page was built for publication: Hamilton decompositions of balanced complete multipartite graphs with primitive leaves