- Tytuł:
- Factor-criticality and matching extension in DCT-graphs
- Autorzy:
-
Favaron, Odile
Favaron, Evelyne
Ryjáček, Zdenĕk - Powiązania:
- https://bibliotekanauki.pl/articles/971953.pdf
- Data publikacji:
- 1997
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
factor-criticality
matching extension
claw
dominated claw toes - Opis:
- 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.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 1997, 17, 2; 271-278
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł