On \(s\)-Hamiltonian line graphs of claw-free graphs

DOI10.1016/J.DISC.2019.06.006zbMath1419.05184OpenAlexW2953698943MaRDI QIDQ2324489

Mingquan Zhan, Ju Zhou, Taoye Zhang, Hong-Jian Lai

Publication date: 11 September 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2019.06.006

zbMATH Keywords

claw-free graphsline graphs\(s\)-Hamiltonian graphs

Mathematics Subject Classification ID

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

Related Items (2)

On the \(s\)-hamiltonianicity of an hourglass-free line graph ⋮ On \(s\)-Hamiltonicity of net-free line graphs

Cites Work

• Unnamed Item
• Unnamed Item
• An \(s\)-Hamiltonian line graph problem
• Edge-connectivity and edge-disjoint spanning trees
• Hamiltonian connectedness in 3-connected line graphs
• Graphs without spanning closed trails
• Spanning trails connecting given edges
• All 4-connected line graphs of claw free graphs are Hamiltonian connected
• Ons-Hamiltonian Line Graphs
• Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
• Hamiltonian results inK1,3-free graphs
• 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
• A reduction method to find spanning Eulerian subgraphs
• A Note on Sub-Eulerian Graphs
• Reflections on graph theory
• On Eulerian and Hamiltonian Graphs and Line Graphs

This page was built for publication: On \(s\)-Hamiltonian line graphs of claw-free graphs