Jan 4, 2021 · Abstract. We present an algorithm to color a graph G with no triangle and no induced 7-vertex path (i.e., a { P 7 , C 3 } -free graph), where ...

Jan 4, 2021 · We present an algorithm to color a graph G with no triangle and no induced 7-vertex path (ie, a -free graph), where every vertex is assigned a list of possible ...

Sep 30, 2014 · We present an algorithm to color a graph G with no triangle and no induced 7-vertex path (ie, a \{P_7,C_3\}-free graph), where every vertex is assigned a list ...

We present an algorithm to color a graph $G$ with no triangle and no induced $7$-vertex path (i.e., a $\{P_7,C_3\}$-free graph), where every vertex is ...

Abstract. We present an algorithm to color a graph G with no triangle and no induced 7-vertex path. (i.e., a 1P7,C3l-free graph), where every vertex is ...

We present an algorithm to color a graph G with no triangle and no induced 7-vertex path (i.e., a {P7,C3}-free graph), where every vertex is assigned a list ...

We present an algorithm to color a graph G with no triangle and no induced 7-vertex path (i.e., a {P7,C3}-free graph), where every vertex is assigned a list ...

Better 3-coloring algorithms: Excluding a triangle and a seven vertex path · Flavia Bonomo-Braberman, M. Chudnovsky, +4 authors. Mingxian Zhong · Published in ...

We present an algorithm to color a graph G with no triangle and no induced 7-vertex path (i.e., a {P-7, C-3}-free graph), where every vertex is assigned a list ...

Better 3-coloring algorithms: Excluding a triangle and a seven vertex path ... Authors: Flavia Bonomo-Braberman; Maria Chudnovsky; Jan Goedgebeur; Peter Maceli ...