An \(s\)-Hamiltonian line graph problem
From MaRDI portal
Publication:995763
DOI10.1007/s00373-007-0727-yzbMath1123.05057OpenAlexW2036580076MaRDI QIDQ995763
Zhi-Hong Chen, Hong-Jian Lai, Deying Li, Wai Chee Shiu
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
Related Items (4)
On the \(s\)-hamiltonianicity of an hourglass-free line graph ⋮ On \(s\)-Hamiltonicity of net-free line graphs ⋮ On the line graph of a graph with diameter 2 ⋮ On \(s\)-Hamiltonian line graphs of claw-free graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Spanning closed trails in graphs
- Graphs without spanning closed trails
- On n-hamiltonian line graphs
- 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
- A reduction method to find spanning Eulerian subgraphs
- Supereulerian graphs: A survey
- On Eulerian and Hamiltonian Graphs and Line Graphs
This page was built for publication: An \(s\)-Hamiltonian line graph problem
