42 citations · 153 across the 70 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2020★ 2 cited
Clustering powers of sparse graphs
Jaroslav Nešetřil, Patrice Ossona de Mendez, Michał Pilipczuk +1
We prove that if is a sparse graph --- it belongs to a fixed class of bounded expansion --- and is fixed, then the th power of can be par…
cs.DM2019
A Connected Version of the Graph Coloring Game
Eric Sopena, Clément Charpentier, Hervé Hocquard +1
The graph coloring game is a two-player game in which, given a graph G and a set of k colors, the two players, Alice and Bob, take turns coloring properly an uncolored vertex of G,…
cs.DM2015★ 4 cited
Completing orientations of partially oriented graphs
Joergen Bang-Jensen, J. Huang, Xuding Zhu
We initiate a general study of what we call orientation completion problems. For a fixed class C of oriented graphs, the orientation completion problem asks whether a given partial…