55 citations · 188 across the 40 of their papers we have counts for
3 papers · 1 filter
Recognizing well-dominated graphs is coNP-complete
Akanksha Agrawal, Henning Fernau, Philipp Kindermann +2
A graph is well-covered if every minimal vertex cover of is minimum, and a graph is well-dominated if every minimal dominating set of is minimum. Studies on well-co…
On Gallai's conjecture for series-parallel graphs and planar 3-trees
Philipp Kindermann, Lena Schlipf, André Schulz
A path cover is a decomposition of the edges of a graph into edge-disjoint simple paths. Gallai conjectured that every connected -vertex graph has a path cover with at most $\lc…
On the Planar Split Thickness of Graphs
David Eppstein, Philipp Kindermann, Stephen Kobourov +7
Motivated by applications in graph drawing and information visualization, we examine the planar split thickness of a graph, that is, the smallest such that the graph is -spl…