A Closure for 1‐Hamilton‐Connectedness in Claw‐Free Graphs
From MaRDI portal
Publication:5417830
DOI10.1002/jgt.21743zbMath1292.05160MaRDI QIDQ5417830
Publication date: 22 May 2014
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21743
Related Items
Hamilton‐connected {claw,net}‐free graphs, II, Hamilton‐connected {claw, bull}‐free graphs, Hamilton‐connected {claw, net}‐free graphs, I, On 1-Hamilton-connected claw-free graphs, Closure and Hamilton-connected claw-free hourglass-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
Cites Work
- Unnamed Item
- Unnamed Item
- Hamilton cycles in 5-connected line graphs
- Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs
- How many conjectures can you stand? A survey
- Closure and Hamiltonian-connectivity of claw-free graphs
- 9-connected claw-free graphs are Hamilton-connected
- On a closure concept in claw-free graphs
- Eulerian subgraphs and Hamilton-connected line graphs
- Nonhamiltonian connected graphs
- Graphs with 1-hamiltonian-connected cubes
- Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs
- On stability of Hamilton-connectedness under the 2-closure in claw-free graphs
- Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
- Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs
- A Theorem on Planar Graphs
- Closure and stable Hamiltonian properties in claw-free graphs
- Reflections on graph theory
- On Eulerian and Hamiltonian Graphs and Line Graphs
