For (bull,claw)-, (bull,chair,C5)-, and (bull,claw,C5)-free graphs, the paper lists all structures that force chromatic number above 4 or 5, and gives a k-colorability criterion for clique expansions of odd cycles.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On $k$-colorability of $(bull, H)$-free graphs
For (bull,claw)-, (bull,chair,C5)-, and (bull,claw,C5)-free graphs, the paper lists all structures that force chromatic number above 4 or 5, and gives a k-colorability criterion for clique expansions of odd cycles.