Local edge-connectivity in regular bipartite graphs (Q1113921): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0095-8956(88)90045-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2024095373 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Grad und lokaler Zusammenhang in endlichen Graphen / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Kantendisjunkte Wege in Graphen / rank | |||
Normal rank | |||
Latest revision as of 10:28, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Local edge-connectivity in regular bipartite graphs |
scientific article |
Statements
Local edge-connectivity in regular bipartite graphs (English)
0 references
1988
0 references
\textit{W. Mader} [Grad und lokaler Zusammenhang in endlichen Graphen, Math. Ann. 205, 9-11 (1973; Zbl 0245.05119)] showed that in every graph G there are two distinct vertices \(x,y\in V(G)\) joined by \(\min (d_ G(x),d_ G(y))\) edge-disjoint paths. It is shown here using Menger's theorem that one can fix x arbitrarily in this result as long as G is regular and bipartite.
0 references
regular bipartite graphs
0 references
local connectivity
0 references
Menger's theorem
0 references
