An s-Hamiltonian line graph problem
From MaRDI portal
Publication:995763
DOI10.1007/S00373-007-0727-YzbMATH Open1123.05057OpenAlexW2036580076MaRDI QIDQ995763FDOQ995763
Zhi-Hong Chen, Deying Li, Wai Chee Shiu, Hong-Jian Lai
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
Cites Work
- Title not available (Why is that?)
- Graphs without spanning closed trails
- 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 (7)
- 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
- 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)
