Proof of a conjecture of Plummer and Zha
From MaRDI portal
Publication:6074589
Abstract: Say a graph is a {em 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 4-connected pentagraph is three-colourable. We prove this: indeed, we will prove that every pentagraph is three-colourable.
Recommendations
Cites work
Cited in
(9)- On the structure of pentagraphs
- On a conjecture concerning the Petersen graph. II
- The chromatic number of a graph with two odd holes and an odd girth
- Proof of a conjecture of Chan, Robbins, and Yuen
- Proof of the Zalcman conjecture for initial coefficients
- Graphs with girth \(2\ell+1\) and without longer odd holes that contain an odd \(K_4\)-subdivision
- Graphs with girth 9 and without longer odd holes are 3-colourable
- scientific article; zbMATH DE number 5578311 (Why is no real title available?)
- On a conjecture concerning the Petersen graph
This page was built for publication: Proof of a conjecture of Plummer and Zha
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6074589)