Note on 3-Coloring of (2P_4,C_5)-Free Graphs
We show that the 3-coloring problem is polynomial-time solvable on (2P_4,C_5)-free graphs.
READ FULL TEXTWe show that the 3-coloring problem is polynomial-time solvable on (2P_4,C_5)-free graphs.
READ FULL TEXT