A note on edge-disjoint Hamilton cycles in line graphs

DOI10.1007/S00373-015-1606-6zbMATH Open1339.05216OpenAlexW782775905MaRDI QIDQ295256FDOQ295256

Hao Li, Yandong Bai, Weihua Yang, Weihua He

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

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

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)

Cites Work

• On a closure concept in claw-free graphs
• Title not available (Why is that?)
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Title not available (Why is that?)
• Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
• Hamiltonian connectedness in 3-connected line graphs
• Every 4-connected line graph of a planar graph is Hamiltonian
• Bounds of the number of disjoint spanning trees
• Every 3-connected, essentially 11-connected line graph is Hamiltonian
• Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected
• Every 3‐connected claw‐free Z ₈ ‐free graph is Hamiltonian
• A Note on Sub-Eulerian Graphs

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)