Abstract
Let G be a cyclically 5-connected cubic graph, and let C be a circuit of G of length 5. We prove that if there is a subgraph of G homeomorphic to the Petersen graph, then there is one which in addition contains C. This greatly simplifies checking whether G has a subgraph homeomorphic to the Petersen graph.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 63-79 |
| Number of pages | 17 |
| Journal | Journal of Combinatorial Theory. Series B |
| Volume | 72 |
| Issue number | 1 |
| DOIs | |
| State | Published - 1998 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics