Proof of a conjecture of Plummer and Zha
暂无分享,去创建一个
Say a graph G is a pentagraph if every cycle has length at least five, and every induced cycle of odd length has length five. N. Robertson proposed the conjecture that the Petersen graph is the only pentagraph that is three-connected and internally 4-connected, but this was disproved by M. Plummer and X. Zha in 2014. Plummer and Zha conjectured that every 3-connected, internally 4connected pentagraph is three-colourable. We prove this: indeed, we will prove that every pentagraph is three-colourable.
[1] Neil Robertson,et al. On a Conjecture Concerning the Petersen Graph , 2011, Electron. J. Comb..
[2] Michael D. Plummer,et al. On a Conjecture Concerning the Petersen Graph: Part II , 2014, Electron. J. Comb..