On factors of 4-connected claw-free graphs

DOI10.1002/jgt.1008zbMath0984.05067OpenAlexW2750801284MaRDI QIDQ2744573

Zdeněk Ryjáček, Matthias Kriesell, Hajo J. 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

claw-free graphline graphHamilton pathfactorHamilton cycle

Mathematics Subject Classification ID

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

Related Items (22)

A note on minimum degree conditions for supereulerian graphs ⋮ On the \(s\)-hamiltonianicity of an hourglass-free line graph ⋮ A note on 3-connected hourglass-free claw-free Hamilton-connected graphs ⋮ Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs ⋮ On Hamiltonicity of 2-connected claw-free graphs ⋮ Induced hourglass and the equivalence between Hamiltonicity and supereulerianity in claw-free graphs ⋮ Hamiltonian connected hourglass free line graphs ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ How many conjectures can you stand? A survey ⋮ 2-factors in claw-free graphs with lower bounds cycle lengths ⋮ Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs ⋮ Connected even factors in claw-free graphs ⋮ The edge-closure concept for claw-free graphs and the stability of forbidden subgraphs ⋮ Small cycles and 2-factor passing through any given vertices in graphs ⋮ Hamiltonicity of 3-connected line graphs ⋮ Hamilton circuits and essential girth of claw free graphs ⋮ On Hamiltonicity of 3-connected claw-free graphs ⋮ On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs ⋮ Forbidden pairs for \(k\)-connected Hamiltonian graphs ⋮ Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs ⋮ All 4-connected line graphs of claw free graphs are Hamiltonian connected ⋮ Spanning trees and spanning Eulerian subgraphs with small degrees

Cites Work

• On hamiltonian line graphs and connectivity
• On a closure concept in claw-free graphs
• Bounds of the number of disjoint spanning trees
• Hamiltonian results inK1,3-free graphs
• Reflections on graph theory
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: On factors of 4-connected claw-free graphs