On a Conjecture Concerning the Petersen Graph: Part II

  • Michael Plummer
  • Xiaoya Zha
DOI: https://doi.org/10.37236/2315
Keywords: Graph theory, Cycles, Connectivity, Petersen Graph

Abstract

Robertson 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.
Published
2014-02-21
How to Cite
Plummer, M., & Zha, X. (2014). On a Conjecture Concerning the Petersen Graph: Part II. The Electronic Journal of Combinatorics, 21(1), P1.34. https://doi.org/10.37236/2315
Issue
Volume 21, Issue 1 (2014)
Article Number
P1.34