A SIMPLE PROOF OF WHITNEY'S THEOREM ON CONNECTIVITY IN GRAPHS

被引：0

作者：

Zhao, Kewen ^{[1
]}

机构：

[1] Moorhead State Univ, Dept Comp Sci & Informat Syst, Moorhead, MN 56563 USA

来源：

MATHEMATICA BOHEMICA | 2011年 / 136卷 / 01期

关键词：

connectivity; graph;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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.

引用

页码：25 / 37

页数：14

共 50 条

[31] On the connectivity of infinite graphs [J].

P. Komjáth .

Acta Mathematica Hungarica, 2018, 154 :215-222

[32] The Connectivity of Token Graphs [J].

Leanos, J. ;

Trujillo-Negrete, A. L. .

GRAPHS AND COMBINATORICS, 2018, 34 (04) :777-790

[33] On the Connectivity of Visibility Graphs [J].

Michael S. Payne ;

Attila Pór ;

Pavel Valtr ;

David R. Wood .

Discrete & Computational Geometry, 2012, 48 :669-681

[34] On connectivity polynomial of graphs [J].

Oboudi, Mohammad Reza .

DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2025, 17 (05)

[35] On the connectivity of infinite graphs [J].

Komjath, P. .

ACTA MATHEMATICA HUNGARICA, 2018, 154 (01) :215-222

[36] Game connectivity of graphs [J].

Matsumoto, Naoki ;

Nakamigawa, Tomoki .

DISCRETE MATHEMATICS, 2020, 343 (11)

[37] On the structure of arbitrarily partitionable graphs with given connectivity [J].

Baudon, Olivier ;

Foucaud, Florent ;

Przybylo, Jakub ;

Wozniak, Mariusz .

DISCRETE APPLIED MATHEMATICS, 2014, 162 :381-385

[38] k-BLOCKS: A CONNECTIVITY INVARIANT FOR GRAPHS [J].

Carmesin, J. ;

Diestel, R. ;

Hamann, M. ;

Hundertmark, F. .

SIAM JOURNAL ON DISCRETE MATHEMATICS, 2014, 28 (04) :1876-1891

[39] A CHAIN THEOREM FOR 3+-CONNECTED GRAPHS [J].

Ding, Guoli ;

Liu, Cheng .

SIAM JOURNAL ON DISCRETE MATHEMATICS, 2012, 26 (01) :102-113

[40] A strengthening of Erdos-Gallai Theorem and proof of Woodall's conjecture [J].

Li, Binlong ;

Ning, Bo .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 2021, 146 :76-95

← 1 2 3 4 5 →