A simple proof of Whitney's Theorem on connectivity in graphs

Kewen Zhao

Mathematica Bohemica (2011)

  • Volume: 136, Issue: 1, page 25-26
  • ISSN: 0862-7959

Abstract

top
In 1932 Whitney showed that a graph G with order n 3 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.

How to cite

top

Zhao, Kewen. "A simple proof of Whitney's Theorem on connectivity in graphs." Mathematica Bohemica 136.1 (2011): 25-26. <http://eudml.org/doc/196590>.

@article{Zhao2011,
abstract = {In 1932 Whitney showed that a graph $G$ with order $n\ge 3$ 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.},
author = {Zhao, Kewen},
journal = {Mathematica Bohemica},
keywords = {connectivity; graph; connectivity; graph},
language = {eng},
number = {1},
pages = {25-26},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {A simple proof of Whitney's Theorem on connectivity in graphs},
url = {http://eudml.org/doc/196590},
volume = {136},
year = {2011},
}

TY - JOUR
AU - Zhao, Kewen
TI - A simple proof of Whitney's Theorem on connectivity in graphs
JO - Mathematica Bohemica
PY - 2011
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 136
IS - 1
SP - 25
EP - 26
AB - In 1932 Whitney showed that a graph $G$ with order $n\ge 3$ 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.
LA - eng
KW - connectivity; graph; connectivity; graph
UR - http://eudml.org/doc/196590
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.