Paths and edge-connectivity in graphs
Let \((s_ 1,t_ 1),...,(s_ k,t_ k)\) be pairs of vertices of a finite graph G. Which conditions G has to fulfill such that there exist edge-disjoint paths \(P_ 1,...,P_ k\) with ends \(s_ i\), \(t_ i\) of \(P_ i\) (1\(\leq i\leq k)?\) This question has been considered by many authors. In this article sufficient conditions for \((\{s_ 1,...,s_ k,t_ 1,...,t_ k\}|\in \{3,4,5\}\) are given. For the case 3 see also \textit{P. D. Seymour} [Discrete Math. 29, 293-309 (1980; Zbl 0457.05043)]. Also a generalization of the following unpublished result of Mader is proved: For every k-edge-connected graph G (\(k\geq 4)\), there exists a path joining two given vertices such that the subgraph obtained from G by deleting the edges of the path is (k-2)-edge-connected.
- Paths in graphs, reducing the edge-connectivity only by two
- Paths and edge-connectivity in graphs. III: Six-terminal k paths
- Local edge-connectivity in regular bipartite graphs
- The maximal size of graphs with at most \(k\) edge-disjoint paths connecting any two adjacent vertices
- A sufficient condition for graphs to be weakly \(k\)-linked
- On a theorem of Mader
- Counterexamples to a conjecture of Mader about cycles through specified vertices in n-edge-connected graphs
- Edge-disjoint trees containing some given vertices in a graph
- A generalization of a theorem of Dirac
- 2-reducible cycles containing three consecutive edges in \((2k+1)\)-edge- connected graphs
- Connectivity keeping paths in \(k\)-connected bipartite graphs
- Paths and trails in edge-colored graphs
- Two paths joining given vertices in \(2k\)-edge-connected graphs
- Disjoint paths in graphs. (Reprint)
- Induced paths in 5-connected graphs
- Note on Whitney's theorem for k-connected graphs
- scientific article; zbMATH DE number 4177105 (Why is no real title available?)
- scientific article; zbMATH DE number 4147534 (Why is no real title available?)
- Mader tools
- scientific article; zbMATH DE number 3957153 (Why is no real title available?)
- scientific article; zbMATH DE number 3991542 (Why is no real title available?)
- scientific article; zbMATH DE number 524123 (Why is no real title available?)
- Local edge and local node connectivity in regular graphs
- scientific article; zbMATH DE number 1744097 (Why is no real title available?)
- Liftings in finite graphs and linkages in infinite graphs with prescribed edge-connectivity
- scientific article; zbMATH DE number 7301719 (Why is no real title available?)
- Highly connected infinite digraphs without edge-disjoint back and forth paths between a certain vertex pair
- scientific article; zbMATH DE number 2192206 (Why is no real title available?)
- scientific article; zbMATH DE number 6475963 (Why is no real title available?)
- On the mixed connectivity conjecture of Beineke and Harary
- Paths containing two adjacent edges in \((2k+1)\)-edge-connected graphs
- Paths through K-specified edges in a linear graph
- 2-reducible two paths and two edges constructing a cycle in (2k+1)-edge-connected graphs
- Bounds on path connectivity
- A sufficient condition for a graph to be weakly k-linked
- Every 4k-edge-connected graph is weakly 3k-linked
- Path transferability of graphs
- Paths and circuits in g-graphs
This page was built for publication: Paths and edge-connectivity in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799691)
