31 citations · 256 across the 67 of their papers we have counts for
Showing 2012 · cs.DSShow all
2 papers · 2 filters
cs.DS2012
List-coloring embedded graphs
Zdenek Dvorak, Ken-ichi Kawarabayashi
For any fixed surface Sigma of genus g, we give an algorithm to decide whether a graph G of girth at least five embedded in Sigma is colorable from an assignment of lists of size t…
cs.DS2012
A dynamic data structure for counting subgraphs in sparse graphs
Zdenek Dvorak, Vojtech Tuma
We present a dynamic data structure representing a graph G, which allows addition and removal of edges from G and can determine the number of appearances of a graph of a bounded si…