Hamilton cycle decomposition of line graphs and a conjecture of Bermond

DOI10.1006/JCTB.1995.1024MaRDI QIDQ1892850zbMATH OpenOpenAlexFDO

Authors P. Paulraja, A. Muthusamy

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

zbMATH Keywords

conjecture of BermonddecompositionHamilton cyclesline graphtwo-factor

Mathematics Subject Classification ID

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

Recommendations

• Hamilton decompositions of some line graphs
• Two Hamiltonian cycles
• Nonexistence of a pair of arc disjoint directed Hamilton cycles on line digraphs of 2-diregular digraphs
• Hamilton decompositions of line graphs of some bipartite graphs
• scientific article; zbMATH DE number 825148

Cited in

(11)

• Two Hamiltonian cycles
• Graphs as navigational infrastructure for high dimensional data spaces
• Hamiltonian cycles in spanning subgraphs of line graphs
• Perfect set of Euler tours of \(K_{p,p,p}\)
• Nonexistence of a pair of arc disjoint directed Hamilton cycles on line digraphs of 2-diregular digraphs
• scientific article; zbMATH DE number 1556200 (Why is no real title available?)
• On Hamilton decompositions of line graphs of non-Hamiltonian graphs and graphs without separating transitions
• Hamilton decompositions of some line graphs
• scientific article; zbMATH DE number 825148 (Why is no real title available?)
• Covering 2-paths uniformly
• Hamilton decompositions of line graphs of some bipartite graphs

This page was built for publication: Hamilton cycle decomposition of line graphs and a conjecture of Bermond

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892850)