# Stefan A. Panait

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.

- Full text PDF available (0)

Learn More

- Harjinder S. Dhaliwal, Angèle M. Hamel, Chính T. Hoàng, Frédéric Maffray, Tyler J. D. McConnell, Stefan A. Panait
- Discrete Applied Mathematics
- 2017

A graph is k-critical if it is k-chromatic but each of its proper induced subgraphs is (k− 1)colorable. It is known that the number of 4-critical P5-free graphs is finite, but there is an infinite number of k-critical P5-free graphs for each k ≥ 5. We show that the number of k-critical (P5, P5)-free graphs is finite for every fixed k. Our result implies the… (More)

- ‹
- 1
- ›