An s-Hamiltonian line graph problem

DOI10.1007/S00373-007-0727-YzbMATH Open1123.05057OpenAlexW2036580076MaRDI QIDQ995763FDOQ995763

Authors: Zhi-Hong Chen, Hong-Jian Lai, Wai Chee Shiu, Deying Li 

Publication date: 10 September 2007

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

Full work available at URL: https://doi.org/10.1007/s00373-007-0727-y

Recommendations

• 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
• On \(s\)-Hamiltonian line graphs
• On \(s\)-Hamiltonian-connected line graphs
• On \(s\)-Hamiltonian line graphs of claw-free graphs
• On \(s\)-Hamiltonicity of net-free line graphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Graphs without spanning closed trails
• Graph theory with applications
• A reduction method to find spanning Eulerian subgraphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Supereulerian graphs: A survey
• Spanning closed trails in graphs
• Super-Eulerian graphs and the Petersen graph. II
• 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
• On n-hamiltonian line graphs

Cited In (8)

• On \(s\)-Hamiltonian-connected line graphs
• On the line graph of a graph with diameter 2
• The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing
• On \(s\)-Hamiltonicity of net-free line graphs
• On the \(s\)-hamiltonianicity of an hourglass-free line graph
• On \(s\)-Hamiltonian line graphs of claw-free graphs
• 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
• Title not available (Why is that?)

This page was built for publication: An \(s\)-Hamiltonian line graph problem

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