Strong Tutte Type Conditions and Factors of Graphs
Let odd(G) denote the number of odd components of a graph G and k ≥ 2 be an integer. We give sufficient conditions using odd(G − S) for a graph G to have an even factor. Moreover, we show that if a graph G satisfies odd(G − S) ≤ max{1, (1/k)|S|} for all S ⊂ V (G), then G has a (k − 1)-regular factor...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2020-11-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.2158 |