Every (P2∪P4, bull)-free graph with clique number at least 3 and no homogeneous set admits a perfect division.
Chudnovsky et al., The strong perfect graph theorem, Annal
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
ACCEPT 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Perfect divisions in ($P_2 \cup P_4$, bull)-free graphs
Every (P2∪P4, bull)-free graph with clique number at least 3 and no homogeneous set admits a perfect division.