Note on 3-Coloring of (2P_4,C_5)-Free Graphs

11/12/2020

∙

by   Vít Jelínek, et al.

∙

0

∙

share

We show that the 3-coloring problem is polynomial-time solvable on (2P_4,C_5)-free graphs.