The authors disprove that graphs with α(G) ≤ 3 are perfectly divisible and prove that even-hole-free graphs are 3-divisible.
Ho` ang, On the structure of (banner, odd hole)-free graphs,J
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
-
On two conjectures of Ho\`ang
The authors disprove that graphs with α(G) ≤ 3 are perfectly divisible and prove that even-hole-free graphs are 3-divisible.