A simple proof of Whitney's Theorem on connectivity in graphs.
| Autor: | Zhao, Kewen |
|---|---|
| Jazyk: | angličtina |
| Předmět: | |
| Druh dokumentu: | Non-fiction |
| Abstrakt: | Abstract: In 1932 Whitney showed that a graph $G$ with order $n\geq3$ is 2-connected if and only if any two vertices of $G$ are connected by at least two internally-disjoint paths. The above result and its proof have been used in some Graph Theory books, such as in Bondy and Murty's well-known Graph Theory with Applications. In this note we give a much simple proof of Whitney's Theorem. |
| Databáze: | Katalog Knihovny AV ČR |
| Externí odkaz: |
|