A cycle C of a graph G is isolating if every component of G-V(C)
is a si...
Recently, Kawarabayashi and Thorup presented the first deterministic
edg...
A planar graph is essentially 4-connected if it is 3-connected and every...
A planar 3-connected graph G is called essentially 4-connected if,
for e...
share