ISSN 1234-3099 (print version)
ISSN 2083-5892 (electronic version)
SCImago Journal Rank (SJR) 2018: 0.763
Rejection Rate (2017-2018): c. 84%
Discussiones Mathematicae Graph Theory 17(2)
(1997) 271-278DOI: 10.7151/dmgt.1054
L.R.I., URA 410 C.N.R.S. Bât. 490, Université de
91405-Orsay cedex, France
Department of Mathematics, University of West Bohemia
Univerzitní 22, 306 14 Plze, Czech Republic
The class of DCT-graphs is a common generalization of the classes of almost claw-free
and quasi claw-free graphs. We prove that every even (2p+1)-connected DCT-graph G is
p-extendable, i.e., every set of p independent edges of G is contained in a perfect
matching of G. This result is obtained as a corollary of a stronger result concerning
factor-criticality of DCT-graphs.
Keywords: factor-criticality, matching extension, claw, dominated claw toes.
1991 Mathematics Subject Classification: 05C70.