All Questions
Tagged with graph-cut planar-graphs
1 question
7
votes
1
answer
413
views
Has Plummer's open problem on the cyclic connectivity of planar graphs been solved?
$\DeclareMathOperator\cl{cl}$The cyclic edge connectivity $\cl(G)$ is the size of a smallest cyclic edge cut, i.e., a smallest edge cut $F$ such that $G-F$ has two connected components, each of which ...
- 1,851