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

11/12/2020 ∙ by Vít Jelínek, et al. ∙ 0

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

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.