4-coloring ($P_6$, bull)-free graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 2016

4-coloring ($P_6$, bull)-free graphs

Résumé

We present a polynomial-time algorithm that determines whether a graph that contains no induced path on six vertices and no bull (the graph with vertices $a,b,c,d,e$ and edges $ab,bc,cd,be,ce$) is $4$-colorable. We also show that for any fixed $k$ the $k$-coloring problem can be solved in polynomial time in the class of ($P_6$, bull, gem)-free graphs.

Dates et versions

hal-01567753 , version 1 (24-07-2017)

Identifiants

Citer

Frédéric Maffray, Lucas Pastor. 4-coloring ($P_6$, bull)-free graphs. Discrete Applied Mathematics, 2016, 231, pp.198-210. ⟨10.1016/j.dam.2016.03.011⟩. ⟨hal-01567753⟩
90 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More