Every minimal nonperfectly divisible fork-free graph is claw-free, and (fork, P7)-free and (fork, P6 union K1)-free graphs are perfectly divisible with chi at most binomial(omega+1, 2).
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 minimal nonperfectly divisible fork-free graphs
Every minimal nonperfectly divisible fork-free graph is claw-free, and (fork, P7)-free and (fork, P6 union K1)-free graphs are perfectly divisible with chi at most binomial(omega+1, 2).