✦ LIBER ✦

On Petersen's graph theorem

✍ Scribed by Nathan Linial

Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 399 KB
Volume: 33
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(81)90257-0

No coin nor oath required. For personal study only.

✦ Synopsis

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 of Tutte's factor theorem [4,5], due to JN&Z [3]. For other extensions of Petersen's theorem, see [6,7, $1.

📜 SIMILAR VOLUMES

Factorizations of 4-Regular Graphs and P

Factorizations of 4-Regular Graphs and Petersen′s Theorem

✍ M. Kouider; G. Sabidussi 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 513 KB

On the basis of the observation that a 3-regular graph has a perfect matching if and only if its line graph has a triangle-free 2 -factorisation, we show that a connected 4-regular graph has a triangle-free 2 -factorisation, provided it has no more than two cut-vertices belonging to a triangle. This

A generalization of Petersen's theorem

✍ Michel X. Goemans 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 338 KB

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

The ubiquitous Petersen graph

✍ Gary Chartrand; Héctor Hevia; Robin J. Wilson 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 507 KB

Efficient Algorithms for Petersen's Matc

Efficient Algorithms for Petersen's Matching Theorem

✍ Therese C. Biedl; Prosenjit Bose; Erik D. Demaine; Anna Lubiw 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 293 KB

Petersen's theorem is a classic result in matching theory from 1891, stating that every 3-regular bridgeless graph has a perfect matching. Our work explores efficient algorithms for finding perfect matchings in such graphs. Previously, the only relevant matching algorithms were for general graphs, a

Locally petersen graphs

✍ J. I. Hall 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 684 KB

## Abstract A graph Γ is locally Petersen if, for each point __t__ of Γ, the graph induced by Γ on all points adjacent to __t__ is isomorphic to the Petersen graph. We prove that there are exactly three isomorphism classes of connected, locally Petersen graphs and further characterize these graphs

Supereulerian Graphs and the Petersen Gr

Supereulerian Graphs and the Petersen Graph

✍ Paul A. Catlin; Hong-Jian Lai 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 619 KB

Any 3-edge-connected graph with at most 10 edge cuts of size 3 either has a spanning closed trail or it is contractible to the Petersen graph.