On 3-connected Hamiltonian line graphs

DOI10.1016/j.disc.2012.02.024zbMath1243.05137OpenAlexW2111204277MaRDI QIDQ427827

Ye Chen, Suohai Fan, Hong-Jian Lai

Publication date: 18 June 2012

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

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

zbMATH Keywords

claw-free graphHamiltonian graphline graphcollapsible graphsupereulerian graphDCT graphP3D graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonicity of 6-connected line graphs
• On hamiltonian line graphs and connectivity
• On hamiltonicity of \(P_{3}\)-dominated graphs
• Hamiltonian connectedness in 3-connected line graphs
• Parallel concepts in graph theory
• On a closure concept in claw-free graphs
• Quasi-claw-free graphs
• Global insertion and Hamiltonicity in DCT-graphs
• All 4-connected line graphs of claw free graphs are Hamiltonian connected
• Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected
• Hamiltonian results inK1,3-free graphs
• A reduction method to find spanning Eulerian subgraphs
• Almost claw‐free graphs
• Reflections on graph theory
• On Eulerian and Hamiltonian Graphs and Line Graphs

This page was built for publication: On 3-connected Hamiltonian line graphs