189 citations · 506 across the 54 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
math.CO2014★ 2 cited
A counterexample to the pseudo 2-factor isomorphic graph conjecture
Jan Goedgebeur
A graph is pseudo 2-factor isomorphic if the parity of the number of cycles in a 2-factor is the same for all 2-factors of . Abreu et al. conjectured that , the Hea…
math.CO2014★ 8 cited
Better 3-coloring algorithms: excluding a triangle and a seven vertex path
Flavia Bonomo-Braberman, Maria Chudnovsky, Jan Goedgebeur +4
We present an algorithm to color a graph with no triangle and no induced -vertex path (i.e., a -free graph), where every vertex is assigned a list of possible c…