- Feature Paper
- Article
Perfect Divisions in (P3 ∪ P4, P6,Bull)-Free Graphs
- Hao Hu and
- Bin Xiong
A graph G is said to be perfect if ω(H)=χ(H) for every induced subgraph H of G, where ω(H) and χ(H) denote the clique number and the chromatic number of H. We say that a graph G admits a perfect division if its vertex set can be p...