12 citations · 24 across the 8 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2021
Avoiding large squares in trees and planar graphs
Daniel Gonçalves, Pascal Ochem, Matthieu Rosenfeld
The Thue number of a graph is the minimum number of colors needed to color without creating a square on a path of . For a graph class , is the supremum…
math.CO2013★ 12 cited
On triangles in K_r-minor free graphs
Boris Albar, Daniel Gonçalves
We study graphs where each edge adjacent to a vertex of small degree (7 and 9, respectively) belongs to many triangles (4 and 5, respectively) and show that these graphs contain a…