On factors of 4-connected claw-free graphs

DOI10.1002/JGT.1008MaRDI QIDQ2744573zbMATH OpenOpenAlexFDO

Authors Matthias Kriesell, Zdeněk Ryjáček, Hajo Broersma

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

zbMATH Keywords

line graphclaw-free graphHamilton cyclefactorHamilton path

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Hourglasses and Hamilton cycles in 4‐connected claw‐free graphs
• Hamiltonian connected hourglass free line graphs
• Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs
• scientific article; zbMATH DE number 637341
• Hamilton cycles in 6-connected claw-free graphs (extended abstract)

Cites work

• 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 Eulerian and Hamiltonian Graphs and Line Graphs
• On a closure concept in claw-free graphs
• On hamiltonian line graphs and connectivity
• Reflections on graph theory

Cited in

(31)

• Induced hourglass and the equivalence between Hamiltonicity and supereulerianity in claw-free graphs
• Factors of 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
• scientific article; zbMATH DE number 2188396 (Why is no real title available?)
• 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 Hamiltonicity of 3-connected claw-free graphs
• On the s-hamiltonianicity of an hourglass-free line graph
• Hamiltonicity of 3-connected line graphs
• On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs
• Disjoint \(K_4^-\) in claw-free graphs with minimum degree at least five
• Hamiltonian connected hourglass free line graphs
• Tank-ring factors in supereulerian claw-free graphs
• All 4-connected line graphs of claw free graphs are Hamiltonian connected
• Forbidden pairs for \(k\)-connected Hamiltonian graphs
• Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs
• Structure of 4-connected claw-free graphs not containing a subdivision of \(K_{5}\)
• On 4-connected claw-free well-covered graphs
• 2-factors in claw-free graphs with lower bounds cycle lengths
• Equivalence of Jackson's and Thomassen's conjectures
• On quadrilaterals and 4-path in claw-free graphs
• Connected even factors in claw-free graphs
• A note on 3-connected hourglass-free claw-free Hamilton-connected graphs
• Small cycles and 2-factor passing through any given vertices in 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)