A closure for 1-Hamilton-connectedness in claw-free graphs
From MaRDI portal
Publication:5417830
Recommendations
- Closure and Hamiltonian-connectivity of claw-free graphs
- On stability of Hamilton-connectedness under the 2-closure in claw-free graphs
- On 1-Hamilton-connected claw-free graphs
- Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
- Closure and Hamilton-connected claw-free hourglass-free graphs
Cites work
- 9-connected claw-free graphs are Hamilton-connected
- A Theorem on Planar Graphs
- Closure and Hamiltonian-connectivity of claw-free graphs
- Closure and stable Hamiltonian properties in claw-free graphs
- Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs
- Eulerian subgraphs and Hamilton-connected line graphs
- Graphs with 1-hamiltonian-connected cubes
- Hamilton cycles in 5-connected line graphs
- Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs
- How many conjectures can you stand? A survey
- scientific article; zbMATH DE number 1002024 (Why is no real title available?)
- Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
- New sufficient conditions for s-Hamiltonian graphs and s-Hamiltonian connected graphs
- Nonhamiltonian connected graphs
- On a closure concept in claw-free graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- On stability of Hamilton-connectedness under the 2-closure in claw-free graphs
- Reflections on graph theory
- Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs
Cited in
(15)- Closure and Hamiltonian-connectivity of claw-free graphs
- Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs
- Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs
- Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected
- Thomassen's conjecture for line graphs of 3-hypergraphs
- On stability of Hamilton-connectedness under the 2-closure in claw-free graphs
- Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
- On 1-Hamilton-connected claw-free graphs
- Hamilton‐connected {claw,net}‐free graphs, II
- Hamilton‐connected {claw, bull}‐free graphs
- Hamilton‐connected {claw, net}‐free graphs, I
- Every 3-connected \(\{K_{1, 3}, \Gamma_3\}\)-free graph is Hamilton-connected
- Hamilton-connected claw-free graphs with small parameters
- On \(s\)-Hamiltonian-connected line graphs
- Closure and Hamilton-connected claw-free hourglass-free graphs
This page was built for publication: A closure for 1-Hamilton-connectedness in claw-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5417830)
