Peter Maceli

activity

20132018

most citedThree-coloring graphs with no induced seven-vertex path II : using a triangle

17 citations · 56 across the 8 of their papers we have counts for

collaborators

Showing 2014 · cs.DMShow all

1 paper · 2 filters

cs.DM2014★ 7 cited

4-coloring $P_{6}$ -free graphs with no induced 5-cycles

Maria Chudnovsky, Peter Maceli, Juraj Stacho +1

We show that the 4-coloring problem can be solved in polynomial time for graphs with no induced 5-cycle $C_{5}$ and no induced 6-vertex path $P_{6}$ .

4-coloring P6​-free graphs with no induced 5-cycles

4-coloring $P_{6}$ -free graphs with no induced 5-cycles