Better 3-Coloring Algorithms: Excluding A Triangle And A Seven Vertex Path | 0 | 0.34 | 2021 |
Coloring graphs with no induced five-vertex path or gem | 0 | 0.34 | 2018 |
Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices. | 1 | 0.37 | 2018 |
4-Coloring P6-Free Graphs with No Induced 5-Cycles. | 0 | 0.34 | 2017 |
Three-coloring graphs with no induced seven-vertex path II : using a triangle. | 1 | 0.37 | 2015 |
Three-coloring graphs with no induced seven-vertex path I : the triangle-free case. | 3 | 0.43 | 2014 |
Simplicial Vertices in Graphs with no Induced Four-Edge Path or Four-Edge Antipath, and the H6-Conjecture. | 0 | 0.34 | 2014 |
Graphs with no induced five-vertex path or antipath. | 1 | 0.36 | 2014 |
4-coloring $P_6$-free graphs with no induced 5-cycles. | 3 | 0.42 | 2014 |
Excluding four-edge paths and their complements | 3 | 0.58 | 2013 |
Ups and downs of the 4-edge path | 1 | 0.59 | 2013 |