Hamilton decompositions of some line graphs

DOI10.1002/jgt.3190200411zbMath0921.05049OpenAlexW2144387620MaRDI QIDQ4857447

David A. Pike

Publication date: 29 November 1995

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190200411

zbMATH Keywords

line graphBermond's conjecture for bipartite graphsHamilton decomposable

Mathematics Subject Classification ID

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

Related Items (4)

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}\) ⋮ Graphs as navigational infrastructure for high dimensional data spaces ⋮ On Hamilton Decompositions of Line Graphs of Non-Hamiltonian Graphs and Graphs without Separating Transitions

Cites Work

• Hamiltonian Decompositions of Graphs, Directed Graphs and Hypergraphs

This page was built for publication: Hamilton decompositions of some line graphs