89 citations · 131 across the 24 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
math.CO2014★ 2 cited
Restricted frame graphs and a conjecture of Scott
Jérémie Chalopin, Louis Esperet, Zhentao Li +1
Scott proved in 1997 that for any tree , every graph with bounded clique number which does not contain any subdivision of as an induced subgraph has bounded chromatic number…
math.CO2014★ 7 cited
Strongly polynomial sequences as interpretations
Andrew Goodall, Jaroslav Nesetril, Patrice Ossona de Mendez
A strongly polynomial sequence of graphs is a sequence of finite graphs such that, for every graph , the number of homomorphisms from to $G_…
math.CO2014
On First-Order Definable Colorings
Jaroslav Nesetril, Patrice Ossona De Mendez
We address the problem of characterizing -coloring problems that are first-order definable on a fixed class of relational structures. In this context, we give several characteri…