Structural descriptions of (bull, house)-free and (bull, P5)-free graphs yield finiteness of k-critical instances for fixed k plus a short proof of perfect divisibility.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Structural description of (bull, house)-free graphs
Structural descriptions of (bull, house)-free and (bull, P5)-free graphs yield finiteness of k-critical instances for fixed k plus a short proof of perfect divisibility.