Hamilton cycle decomposition of line graphs and a conjecture of Bermond
From MaRDI portal
Publication:1892850
DOI10.1006/jctb.1995.1024zbMath0831.05056OpenAlexW2033051776MaRDI QIDQ1892850
Publication date: 4 July 1995
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1995.1024
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items (6)
Nonexistence of a pair of arc disjoint directed Hamilton cycles on line digraphs of 2-diregular digraphs ⋮ Perfect set of Euler tours of \(K_{p,p,p}\) ⋮ Covering 2-paths uniformly ⋮ Graphs as navigational infrastructure for high dimensional data spaces ⋮ On Hamilton Decompositions of Line Graphs of Non-Hamiltonian Graphs and Graphs without Separating Transitions ⋮ Two Hamiltonian cycles
This page was built for publication: Hamilton cycle decomposition of line graphs and a conjecture of Bermond