On s-Hamiltonicity of net-free line graphs
From MaRDI portal
On \(s\)-Hamiltonicity of net-free line graphs
Recommendations
Cites work
- 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
- A reduction method to find spanning Eulerian subgraphs
- Advances on the Hamiltonian problem -- a survey
- An s-Hamiltonian line graph problem
- Claw-free graphs---a survey
- Eulerian subgraphs and Hamilton-connected line graphs
- Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected
- Every 3-connected claw-free \(Z_{8}\)-free graph is Hamiltonian
- Forbidden subgraphs for hamiltonicity of 3-connected claw-free graphs
- Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
- Graph theory
- Hamilton cycles in 3-connected claw-free and net-free graphs
- Hamilton cycles in 5-connected line graphs
- Hamiltonian connectedness in 3-connected line graphs
- Hamiltonian results inK1,3-free graphs
- scientific article; zbMATH DE number 4055653 (Why is no real title available?)
- scientific article; zbMATH DE number 6890310 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
- On 1-Hamilton-connected claw-free graphs
- On s-Hamiltonian line graphs
- On \(s\)-Hamiltonian line graphs of claw-free graphs
- On a closure concept in claw-free graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- On hamiltonian line graphs and connectivity
- On some intriguing problems in Hamiltonian graph theory---a survey
- Recent advances on the Hamiltonian problem: survey III
- Reduced graphs of diameter two
- Reflections on graph theory
- Super-Eulerian graphs and the Petersen graph. II
- Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs
- Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs
- Supereulerian graphs: A survey
Cited in
(6)
This page was built for publication: On \(s\)-Hamiltonicity of net-free line graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2219965)