On a Conjecture Concerning the Petersen Graph: Part II

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.

[1]  A. M. Murray.  The strong perfect graph theorem , 2019, 100 Years of Math Milestones.

[2]  Neil Robertson,et al.  On a Conjecture Concerning the Petersen Graph , 2011, Electron. J. Comb..