7 citations · 19 across the 9 of their papers we have counts for
1 paper · 1 filter
Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt
We study the recognition complexity of subgraphs of k-connected planar cubic graphs for k = 1, 2, 3. We present polynomial-time algorithms to recognize subgraphs of 1- and 2-connec…