Polynomial Cases for the Vertex Coloring Problem

Authors

T. Karthick, Indian Statistical Institute Chennai
Frédéric Maffray, Universite Grenoble Alpes
Lucas Pastor, Universite Grenoble Alpes

Article Type

Research Article

Publication Title

Algorithmica

Abstract

The computational complexity of the Vertex Coloring problem is known for all hereditary classes of graphs defined by forbidding two connected five-vertex induced subgraphs, except for seven cases. We prove the polynomial-time solvability of four of these problems: for (P 5 , dart)-free graphs, (P 5 , banner)-free graphs, (P 5 , bull)-free graphs, and (fork, bull)-free graphs.

First Page

1053

Last Page

1074

DOI

10.1007/s00453-018-0457-y

Publication Date

3-15-2019

Comments

Open Access, Green

Recommended Citation

Karthick, T.; Maffray, Frédéric; and Pastor, Lucas, "Polynomial Cases for the Vertex Coloring Problem" (2019). Journal Articles. 917.
https://digitalcommons.isical.ac.in/journal-articles/917