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.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics