On \(s\)-Hamiltonian-connected line graphs

DOI10.1016/j.disc.2007.07.120zbMath1177.05068OpenAlexW2128361252MaRDI QIDQ941364

Yehong Shao, Yanting Liang, Hong-Jian Lai

Publication date: 4 September 2008

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

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

zbMATH Keywords

line graphHamiltonian-connectedcollapsible

Mathematics Subject Classification ID

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

Related Items

On the \(s\)-hamiltonianicity of an hourglass-free line graph, On 1-Hamilton-connected claw-free graphs, The Hamiltonicity of essentially 9‐connected line graphs, On the line graph of a graph with diameter 2, The spanning connectivity of line graphs, 1-(edge-)trail-connected square tree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On hamiltonian line graphs and connectivity
• Graphs without spanning closed trails
• Eulerian subgraphs and Hamilton-connected line graphs
• A reduction method to find spanning Eulerian subgraphs
• Reflections on graph theory
• On Eulerian and Hamiltonian Graphs and Line Graphs