On traceability and 2-factors in claw-free graphs

DOI10.7151/dmgt.1213zbMath1055.05094OpenAlexW2058418135MaRDI QIDQ4823294

Zdzisław Skupień, Dalibor Fronček, Zdeněk Ryjáček

Publication date: 27 October 2004

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1213

zbMATH Keywords

Hamiltonianindependence number2-factorclaw-free graphclique covering numberdegree condition

Mathematics Subject Classification ID

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

Related Items

Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs, On sufficient degree conditions for traceability of claw-free graphs, Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs, A note on degree conditions for traceability in locally claw-free graphs, Computing Sharp 2-Factors in Claw-Free Graphs, Computing sharp 2-factors in claw-free graphs, Spanning trails in a 2-connected graph