On a conjecture concerning the Petersen graph. II

MaRDI QIDQ405121zbMATH OpenFDO

Authors Xiaoya Zha, Michael D. Plummer

Publication date 4 September 2014

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i1p34

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

connectivitycyclesgraph theoryPetersen graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

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)].

Recommendations

• On a conjecture concerning the Petersen graph
• Counterexamples to a conjecture about Petersen-minors in supersnarks
• Proof of a conjecture of Plummer and Zha
• An extremal problem for subdivisions ofK?5
• scientific article; zbMATH DE number 4106902

Cites work

• On a conjecture concerning the Petersen graph
• The strong perfect graph theorem

Cited in

(13)

• A note on chromatic number and induced odd cycles
• A note on a conjecture of Wu, Xu and Xu
• scientific article; zbMATH DE number 4106902 (Why is no real title available?)
• On the structure of pentagraphs
• Proof of a conjecture of Plummer and Zha
• The chromatic number of a graph with two odd holes and an odd girth
• On the chromatic number of graphs of odd girth without longer odd holes
• Graphs with girth \(2\ell+1\) and without longer odd holes that contain an odd \(K_4\)-subdivision
• On a conjecture concerning the Petersen graph
• Graphs with girth 9 and without longer odd holes are 3-colourable
• Graphs with girth 2 +1 and without longer odd holes are 3-colorable
• Coloring of graphs without long odd holes
• Nonplanar graphs and well-covered cycles

This page was built for publication: On a conjecture concerning the Petersen graph. II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405121)