Paths in graphs, reducing the edge-connectivity only by two (Q1066914): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A sufficient condition for a graph to be weakly k-linked / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Reduction Method for Edge-Connectivity in Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a property of n-edge-connected digraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3718456 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 18:37, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Paths in graphs, reducing the edge-connectivity only by two |
scientific article |
Statements
Paths in graphs, reducing the edge-connectivity only by two (English)
0 references
1985
0 references
For distinct vertices a and b in a finite, connected, undirected graph G, let \(\lambda\) (a,b;G) denote the maximum number of edge disjoint paths joining a and b. The following major result is presented. For any fixed pair of distinct vertices \(x_ 1\) and \(y_ 1\) in G there exists a path P joining \(x_ 1\) and \(y_ 1\) such that for all pairs of vertices x and y in G we have \(\lambda\) (x,y;G-E(P))\(\geq \lambda (x,y;G)-2\) where E(P) denotes the edge set of P.
0 references
edge disjoint paths
0 references