✦ LIBER ✦

Addressing the Petersen graph

✍ Scribed by Randall J. Elzinga; David A. Gregory; Kevin N. Vander Meulen

Book ID: 104444144
Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 310 KB
Volume: 11
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00071-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

✍ Randall J. Elzinga; David A. Gregory; Kevin N. Vander Meulen 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 157 KB

The ubiquitous Petersen graph

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

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.

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

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

The spectrum problem for the Petersen gr

The spectrum problem for the Petersen graph

✍ Adams, Peter; Bryant, Darryn E. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 305 KB 👁 2 views

It is shown that there exists a decomposition of K,, into edge-disjoint copies of the Petersen graph if and only if 'u = 1 or 10 (mod 151, 'u # 10.