Goemans, M.X., A generalization of Petersen's theorem, Discrete Mathematics 115 (1993) 277-282. Petersen's theorem asserts that any cubic graph with at most 2 cut edges has a perfect matching. We generalize this classical result by showing that any cubic graph G = (V, E) with at most 1 cut edge has
โฆ LIBER โฆ
A Proof of Petersen's Theorem
โ Scribed by H. R. Brahana
- Book ID
- 123919824
- Publisher
- John Hopkins University Press
- Year
- 1917
- Tongue
- English
- Weight
- 386 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0003-486X
- DOI
- 10.2307/1967667
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A generalization of Petersen's theorem
โ
Michel X. Goemans
๐
Article
๐
1993
๐
Elsevier Science
๐
English
โ 338 KB
On Petersen's graph theorem
โ
Nathan Linial
๐
Article
๐
1981
๐
Elsevier Science
๐
English
โ 399 KB
In thiq paper we prove the following: let G be a graph with k edges, wihich js (k -l)-edgeconnectd, and with all valences 3k k. Let 1 c r~ k be an integer, then (3 -tins a spanning subgraph H, so that all valences in H are ar, with no more than r~/r:] edges. The proof is based on a useful extension
A proof of Thom's theorem
โ
A. L. Liulevicius
๐
Article
๐
1962
๐
European Mathematical Society
๐
English
โ 409 KB
A proof of Serre's theorem
โ
N.L. Biggs
๐
Article
๐
1989
๐
Elsevier Science
๐
English
โ 253 KB
A proof of Beboutov's theorem
โ
Shizuo Kakutani
๐
Article
๐
1968
๐
Elsevier Science
๐
English
โ 340 KB
A proof of Fuglede's Theorem
โ
Joseph B Deeds
๐
Article
๐
1969
๐
Elsevier Science
๐
English
โ 64 KB