ISSN:
1435-5914
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract For each oddn≥3, we constructn-edge-connected graphsG with the following property: There are two verticesu andv inG such that for every cycleC inG passign throughu andv the graphG-E(C) is not (n-2)-edge-connected. HereE(C) denotes the set of edges ofC, and a cycle is allowed to pass through a vertex more than once.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF02349962