Hamilton decomposable graphs with specified leaves

DOI10.1007/s00373-004-0573-0zbMath1054.05065OpenAlexW2009698418MaRDI QIDQ704849

C. A. Rodger

Publication date: 20 January 2005

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-004-0573-0

zbMATH Keywords

Hamilton decompositions

Mathematics Subject Classification ID

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

Related Items (10)

Hamilton cycle rich 2-factorization of complete bipartite graphs ⋮ Hamilton cycle rich 2-factorization of complete equipartite graphs. II ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ All graphs with maximum degree three whose complements have 4-cycle decompositions ⋮ On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors ⋮ Hamilton cycle rich 2-factorizations of complete multipartite graphs ⋮ Hamilton decompositions of balanced complete multipartite graphs with primitive leaves ⋮ Enclosings of \(\lambda\)-fold 5-cycle systems for \(u = 2\) ⋮ Hamilton cycle rich two-factorizations of complete graphs ⋮ Hamilton decompositions of graphs with primitive complements

This page was built for publication: Hamilton decomposable graphs with specified leaves