30 citations · 66 across the 7 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2016
Characterising Bounded Expansion by Neighbourhood Complexity
Felix Reidl, Fernando Sánchez Villaamil, Konstantinos Stavropoulos
We show that a graph class has bounded expansion if and only if it has bounded -neighbourhood complexity, i.e. for any vertex set of any subgraph of $G\in\cal G…
cs.DM2014
The Maximum k-Differential Coloring Problem
Michael Bekos, Stephen Kobourov, Michael Kaufmann +1
Given an -vertex graph and two positive integers , the ()-differential coloring problem asks for a coloring of the vertices of (if one exists)…