On Hamilton Decompositions of Line Graphs of Non-Hamiltonian Graphs and Graphs without Separating Transitions

zbMath1404.05164arXiv1710.06037MaRDI QIDQ4614042

Barbara M. Maenhaut, Benjamin R. Smith, Darryn E. Bryant

Publication date: 30 January 2019

Full work available at URL: https://arxiv.org/abs/1710.06037

zbMATH Keywords

line graphEuler toursisotropic systemsedge-disjoint Hamilton circuits

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Related Items

Two Hamiltonian cycles

Cites Work

• The 1-factorization of some line-graphs
• A characterisation of graphs having three pariwise compatible Euler tours
• Hamilton cycle decomposition of line graphs and a conjecture of Bermond
• On the maximum number of pairwise compatible euler cycles
• Cycles containing matchings and pairwise compatible euler tours
• A Construction of a perfect set of Euler tours of K2k+1
• Decompositions of complete graphs into triangles and Hamilton cycles
• Hamilton decompositions of some line graphs
• Hamilton decompositions of line graphs of some bipartite graphs
• Research problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item