Petruševski–Škrekovski rich-neighbour 5-colouring conjecture
This entry tracks Petruševski–Škrekovski rich-neighbour 5-colouring conjecture.
It enlarges the verified domain of the conjecture for subcubic multigraphs.
Latest development
Two structural graph classes satisfy the conjectured bound, which is sharp in both classes.
Editorial caveat
The general conjecture remains open.
References
- Two results on rich-neighbour 5-colouring of subcubic graphs — arXiv — Masaki Kashima, Mirko Petruševski, Jelena Sedlar, Riste Škrekovski
Source: arXiv
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.