Elsevier

Discrete Applied Mathematics

Volume 186, 11 May 2015, Pages 106-111
Discrete Applied Mathematics

Polynomial-time algorithms for minimum weighted colorings of (P5,P¯5)-free graphs and similar graph classes

https://doi.org/10.1016/j.dam.2015.01.022Get rights and content
Under an Elsevier user license
open archive

Abstract

We design an O(n3) algorithm to find a minimum weighted coloring of a (P5,P¯5)-free graph. Furthermore, the same technique can be used to solve the same problem for several classes of graphs, defined by forbidden induced subgraphs, such as (diamond, co-diamond)-free graphs.

Keywords

Graph coloring
P5-free graphs

Cited by (0)