The coloring problem for $\{P_5,\bar{P_5}\}$-free graphs and $\{P_5,K_p-e\}$-free graphs is polynomial

D. S. Malyshev; O. O. Lobanova

The coloring problem for $\{P_5,\bar{P_5}\}$-free graphs and $\{P_5,K_p-e\}$-free graphs is polynomial

Discrete Mathematics 2015-03-10 v1

Authors: D. S. Malyshev , O. O. Lobanova

Abstract

We show that determining the chromatic number of a $\{P_5,\bar{P_5}\}$ -free graph or a $\{P_5,K_p-e\}$ -free graph can be done in polynomial time

Keywords

graph coloring forbidden induced subgraphs polynomial-time algorithm P5-free graphs chromatic number complement of P5 Kp-e-free graphs

Cite

@article{arxiv.1503.02550,
  title  = {The coloring problem for $\{P_5,\bar{P_5}\}$-free graphs and $\{P_5,K_p-e\}$-free graphs is polynomial},
  author = {D. S. Malyshev and O. O. Lobanova},
  journal= {arXiv preprint arXiv:1503.02550},
  year   = {2015}
}