On a conjecture concerning the Petersen graph. II (Q405121): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The strong perfect graph theorem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a conjecture concerning the Petersen graph / rank | |||
Normal rank | |||
Latest revision as of 23:47, 8 July 2024
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
