On a conjecture concerning the Petersen graph. II (Q405121)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On a conjecture concerning the Petersen graph. II |
scientific article; zbMATH DE number 6340132
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a conjecture concerning the Petersen graph. II |
scientific article; zbMATH DE number 6340132 |
Statements
On a conjecture concerning the Petersen graph. II (English)
0 references
4 September 2014
0 references
Summary: \textit{N. Robertson} [personal communication to second author] conjectured that the only 3-connected, internally 4-connected graph of girth 5 in which every odd cycle of length greater than 5 has a chord is the Petersen graph. We provide a counterexample to this conjecture. For Part I see [\textit{D. Nelson} et al., ibid. 18, No. 1, Research Paper P20, 37 p. (2011; Zbl 1223.05157)].
0 references
graph theory
0 references
cycles
0 references
connectivity
0 references
Petersen graph
0 references
0.954887330532074
0 references
0.93355393409729
0 references
0.8348915576934814
0 references
0.8308169841766357
0 references
