Paths in graphs,reducing the edge-connectivity only by two |
| |
Authors: | W. Mader |
| |
Affiliation: | 1. Institut für Mathematik, Universit?t Hannover, D-3000, Hannover 1, West Germany
|
| |
Abstract: | For every pair of verticesx andy in a connected, finite, undirected graphG, there is a pathP joiningx andy such that deleting the edges ofP fromG, for every pair of vertices ofG, the local edge-connectivity decreases by at most two. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|