A note on edge-disjoint Hamilton cycles in line graphs

DOI10.1007/S00373-015-1606-6MaRDI QIDQ295256zbMATH OpenOpenAlexFDO

Authors Weihua Yang, Hao Li, Weihua He, Yandong Bai

Publication date 13 June 2016

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

Full work available at URL https://doi.org/10.1007/s00373-015-1606-6

zbMATH Keywords

line graphHamilton cycleedge-disjoint Hamilton cycles

Mathematics Subject Classification ID

Vertex degrees (05C07) Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Hamiltonian cycles in spanning subgraphs of line graphs
• scientific article; zbMATH DE number 3946175
• scientific article; zbMATH DE number 4006296
• On circuits and pancyclic line graphs
• scientific article; zbMATH DE number 3959474

Cites work

• scientific article; zbMATH DE number 4173021 (Why is no real title available?)
• A Note on Sub-Eulerian Graphs
• Bounds of the number of disjoint spanning trees
• Edge-Disjoint Spanning Trees of Finite Graphs
• Every 3-connected claw-free \(Z_{8}\)-free graph is Hamiltonian
• Every 3-connected, essentially 11-connected line graph is Hamiltonian
• Every 4-connected line graph of a planar graph is Hamiltonian
• Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected
• Graph theory with applications
• Hamiltonian connectedness in 3-connected line graphs
• Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• On a closure concept in claw-free graphs
• On the Problem of Decomposing a Graph into n Connected Factors

Cited in

(1)

• A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks

This page was built for publication: A note on edge-disjoint Hamilton cycles in line graphs

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