On factors of 4-connected claw-free graphs
This paper is motivated by the following two conjectures. Conjecture 1 (\textit{C. Thomassen} [J. Graph Theory 10, 309-324 (1986; Zbl 0614.05050)]): Every 4-connected line graph is Hamiltonian. Conjecture 2 (\textit{M. M. Matthews} and \textit{D. P. Sumner} [J. Graph Theory 8, 139-146 (1984; Zbl 0536.05047)]): Every 4-connected claw-free graph is Hamiltonian. Since line graphs are claw-free, Conjecture 2 implies Conjecture 1. In 1997, the third author of the present paper showed that these conjectures are equivalent. In the present paper the authors show that Conjecture 2 is true within the class of so-called hourglass-free graphs, i.e., graphs that do not contain an induced subgraph isomorphic to two triangles meeting in exactly one vertex. In addition, the authors prove the following weaker form of Conjecture 2. Every 4-connected claw-free graph contains a connected factor which has degree 2 or 4 at each vertex.
- Bounds of the number of disjoint spanning trees
- Closure, path-factors and path coverings in claw-free graphs
- Graph theory with applications
- Hamiltonian results inK1,3-free graphs
- On a closure concept in claw-free graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- On hamiltonian line graphs and connectivity
- Reflections on graph theory
- On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs
- A note on minimum degree conditions for supereulerian graphs
- Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs
- All 4-connected line graphs of claw free graphs are Hamiltonian connected
- On 4-connected claw-free well-covered graphs
- On Hamiltonicity of 2-connected claw-free graphs
- The independence number of connected (claw, K₄)-free 4-regular graphs
- On the s-hamiltonianicity of an hourglass-free line graph
- A note on 3-connected hourglass-free claw-free Hamilton-connected graphs
- Disjoint \(K_4^-\) in claw-free graphs with minimum degree at least five
- Spanning trees and spanning Eulerian subgraphs with small degrees
- Equivalence of Jackson's and Thomassen's conjectures
- Tank-ring factors in supereulerian claw-free graphs
- Hamiltonian connected hourglass free line graphs
- Recent advances on the Hamiltonian problem: survey III
- Connected even factors in claw-free graphs
- On quadrilaterals and 4-path in claw-free graphs
- Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs
- Induced hourglass and the equivalence between Hamiltonicity and supereulerianity in claw-free graphs
- Factors of claw-free graphs
- scientific article; zbMATH DE number 637341 (Why is no real title available?)
- 2-factors in claw-free graphs with lower bounds cycle lengths
- Structure of 4-connected claw-free graphs not containing a subdivision of \(K_{5}\)
- scientific article; zbMATH DE number 2188396 (Why is no real title available?)
- Hamilton circuits and essential girth of claw free graphs
- How many conjectures can you stand? A survey
- Small cycles and 2-factor passing through any given vertices in graphs
- Hamiltonicity of 3-connected line graphs
- On Hamiltonicity of 3-connected claw-free graphs
- Forbidden pairs for \(k\)-connected Hamiltonian graphs
- Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs
- The edge-closure concept for claw-free graphs and the stability of forbidden subgraphs
This page was built for publication: On factors of 4-connected claw-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2744573)
