24 citations · 100 across the 34 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.DM2012★ 24 cited
Vertex elimination orderings for hereditary graph classes
Pierre Aboulker, Pierre Charbit, Nicolas Trotignon +1
We provide a general method to prove the existence and compute efficiently elimination orderings in graphs. Our method relies on several tools that were known before, but that were…
cs.DM2012
Excluding 4-wheels
Pierre Aboulker
A 4-wheel is a graph formed by a cycle C and a vertex not in C that has at least four neighbors in C. We prove that a graph G that does not contain a 4-wheel as a subgraph is 4-col…