On 1-Hamilton-connected claw-free graphs
From MaRDI portal
Publication:394533
DOI10.1016/j.disc.2013.12.009zbMath1281.05085OpenAlexW2094911872MaRDI QIDQ394533
Zdeněk Ryjáček, Petr Vrána, Tomáš Kaiser
Publication date: 27 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2013.12.009
Related Items
Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs, On the \(s\)-hamiltonianicity of an hourglass-free line graph, Thomassen's conjecture for line graphs of 3-hypergraphs, On \(s\)-Hamiltonicity of net-free line graphs, Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs, On the extended Clark-Wormold Hamiltonian-like index problem, A condition on Hamilton-connected line graphs
Cites Work
- 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
- On \(s\)-Hamiltonian-connected line graphs
- Graphs without spanning closed trails
- On a closure concept in claw-free graphs
- Eulerian subgraphs and Hamilton-connected 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
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Closure and stable Hamiltonian properties in claw-free graphs
- An analogue of the Whithey theorem for edge graphs of multigraphs, and edge multigraphs
- Reflections on graph theory
- A Closure for 1‐Hamilton‐Connectedness in Claw‐Free Graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
