Defending planar graphs against star-cutsets
N Sonnerat, A Vetta - Electronic Notes in Discrete Mathematics, 2009 - Elsevier
We consider the problem of protecting edges in a graph so that the graph remains
connected after the removal of any set of vertices that form a star consisting of unprotected …
connected after the removal of any set of vertices that form a star consisting of unprotected …
Galaxy cutsets in graphs
N Sonnerat, A Vetta - Journal of combinatorial optimization, 2010 - Springer
Given a network G=(V, E), we say that a subset of vertices S⊆ V has radius r if it is spanned
by a tree of depth at most r. We are interested in determining whether G has a cutset that can …
by a tree of depth at most r. We are interested in determining whether G has a cutset that can …
Galaxy cutsets and graph connectivity: variations on a theme
N Sonnerat - 2011 - escholarship.mcgill.ca
In this thesis we consider cutsets in graphs which can be expressed as unions of sets each
of which is spanned by a tree of diameter at most d− 1 for some integer d≥ 1; we call these …
of which is spanned by a tree of diameter at most d− 1 for some integer d≥ 1; we call these …