Two sufficient degree conditions are given for graphs to be (P≥3,m)-factor deleted and (P≥3,k)-factor critical.
The binding number of a graph and its Anderson number, Journal of Combinatorial Theory, Series B 1973
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Two sufficient conditions for graphs to admit path factors
Two sufficient degree conditions are given for graphs to be (P≥3,m)-factor deleted and (P≥3,k)-factor critical.