On a conjecture concerning the Petersen graph. II (Q405121): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / author | |||
| Property / author: Michael D. Plummer / rank | |||
Normal rank | |||
| Property / review text | |||
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)]. | |||
| Property / review text: 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)]. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C38 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C40 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6340132 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
graph theory | |||
| Property / zbMATH Keywords: graph theory / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
cycles | |||
| Property / zbMATH Keywords: cycles / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
connectivity | |||
| Property / zbMATH Keywords: connectivity / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Petersen graph | |||
| Property / zbMATH Keywords: Petersen graph / rank | |||
Normal rank | |||
Revision as of 17:16, 29 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a conjecture concerning the Petersen graph. II |
scientific article |
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
