On factors of 4-connected claw-free graphs
DOI10.1002/JGT.1008zbMATH Open0984.05067OpenAlexW2750801284MaRDI QIDQ2744573FDOQ2744573
Zdeněk Ryjáček, Hajo Broersma, Matthias Kriesell
Publication date: 16 December 2001
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://research.utwente.nl/en/publications/on-factors-of-4connected-clawfree-graphs(8f7bd2c8-5efc-45e3-b346-d0e2377b14d1).html
Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- On a closure concept in claw-free graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- Hamiltonian results inK1,3-free graphs
- Bounds of the number of disjoint spanning trees
- Reflections on graph theory
- On hamiltonian line graphs and connectivity
- Closure, path-factors and path coverings in claw-free graphs
Cited In (29)
- Factors of claw-free graphs
- Induced hourglass and the equivalence between Hamiltonicity and supereulerianity in claw-free graphs
- How many conjectures can you stand? A survey
- Spanning trees and spanning Eulerian subgraphs with small degrees
- The edge-closure concept for claw-free graphs and the stability of forbidden subgraphs
- Recent advances on the Hamiltonian problem: survey III
- A note on minimum degree conditions for supereulerian graphs
- Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs
- Hamilton circuits and essential girth of claw free graphs
- Title not available (Why is that?)
- On Hamiltonicity of 2-connected claw-free graphs
- Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs
- The independence number of connected (claw, \(K_4\))-free 4-regular graphs
- On the \(s\)-hamiltonianicity of an hourglass-free line graph
- On Hamiltonicity of 3-connected claw-free graphs
- Hamiltonicity of 3-connected line graphs
- Disjoint \(K_4^-\) in claw-free graphs with minimum degree at least five
- On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs
- Hamiltonian connected hourglass free line graphs
- All 4-connected line graphs of claw free graphs are Hamiltonian connected
- Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs
- Forbidden pairs for \(k\)-connected Hamiltonian graphs
- On 4-connected claw-free well-covered graphs
- Structure of 4-connected claw-free graphs not containing a subdivision of \(K_{5}\)
- On quadrilaterals and 4-path in claw-free graphs
- Connected even factors in claw-free graphs
- 2-factors in claw-free graphs with lower bounds cycle lengths
- A note on 3-connected hourglass-free claw-free Hamilton-connected graphs
- Small cycles and 2-factor passing through any given vertices in graphs
Recommendations
- Title not available (Why is that?) 👍 👎
- Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs 👍 👎
- Hourglasses and Hamilton cycles in 4‐connected claw‐free graphs 👍 👎
- Hamilton cycles in 6-connected claw-free graphs (extended abstract) 👍 👎
- Hamiltonian connected hourglass free line graphs 👍 👎
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)
