A Petersen on a pentagon (Q1386419)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1154560
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Petersen on a pentagon |
scientific article; zbMATH DE number 1154560 |
Statements
A Petersen on a pentagon (English)
0 references
21 June 1999
0 references
The following theorem is proved: Let \(G\) be a cyclically 5-connected cubic graph, and let \(C\) be a cycle of \(G\) with length 5. If there is a subdivision of the Petersen graph in \(G\), then there is one containing \(C\). This result provides a significant simplification in checking whether a given graph does or does not contain a subdivision of the Petersen graph.
0 references
cyclic connectivity
0 references
subdivision
0 references
Petersen graph
0 references
0.80521226
0 references
0.8002256
0 references
