On a Conjecture Concerning the Petersen Graph: Part II

Michael Plummer, Xiaoya Zha

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.

Keywords


Graph theory, Cycles, Connectivity, Petersen Graph

Full Text: PDF