Addressing the Petersen graph
β Scribed by Randall J. Elzinga; David A. Gregory; Kevin N. Vander Meulen
- Book ID
- 108113466
- Publisher
- Elsevier Science
- Year
- 2004
- Tongue
- English
- Weight
- 157 KB
- Volume
- 286
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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.
## 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
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
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.