Abstract
We prove that every 3-regular graph with no circuit of length less than six has a subgraph isomorphic to a subdivision of the Petersen graph.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 1413-1423 |
| Number of pages | 11 |
| Journal | Combinatorica |
| Volume | 39 |
| Issue number | 6 |
| DOIs | |
| State | Published - Dec 1 2019 |
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics
- Computational Mathematics
Fingerprint
Dive into the research topics of 'Girth Six Cubic Graphs Have Petersen Minors'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver