On s-Hamiltonian line graphs of claw-free graphs
From MaRDI portal
Publication:2324489
Recommendations
Cites work
- 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
- A Note on Sub-Eulerian Graphs
- A reduction method to find spanning Eulerian subgraphs
- All 4-connected line graphs of claw free graphs are Hamiltonian connected
- An s-Hamiltonian line graph problem
- Edge-connectivity and edge-disjoint spanning trees
- Graph theory with applications
- Graphs without spanning closed trails
- Hamiltonian connectedness in 3-connected line graphs
- Hamiltonian results inK1,3-free graphs
- scientific article; zbMATH DE number 3987316 (Why is no real title available?)
- Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
- On s-Hamiltonian line graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- Reflections on graph theory
- Spanning trails connecting given edges
Cited in
(9)- On the s-hamiltonianicity of an hourglass-free line graph
- On s-Hamiltonicity of net-free line graphs
- On s-Hamiltonian line graphs
- scientific article; zbMATH DE number 637341 (Why is no real title available?)
- scientific article; zbMATH DE number 1420921 (Why is no real title available?)
- Hamiltonicity of 4-connected line graph of a planar graph
- Completely independent spanning trees in the line graph of complete multipartite graphs
- On \(s\)-Hamiltonian-connected line graphs
- An s-Hamiltonian line graph problem
This page was built for publication: On \(s\)-Hamiltonian line graphs of claw-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2324489)