56 citations · 715 across the 68 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.CO2011★ 21 cited
The chromatic gap and its extremes
András Gyárfás, András Sebõ, Nicolas Trotignon
The {\em chromatic gap} is the difference between the chromatic number and the clique number of a graph. Here we investigate $\gap(n)$, the maximum chromatic gap over graphs on …
cs.DS2011★ 22 cited
Detecting 2-joins faster
Pierre Charbit, Michel Habib, Nicolas Trotignon +1
2-joins are edge cutsets that naturally appear in the decomposition of several classes of graphs closed under taking induced subgraphs, such as balanced bipartite graphs, even-hole…