1 problem

Matching

McDiarmid–Reed's conjecture for hexagonal graphs
About 8 years old
McDiarmid–Reed's conjecture. Every hexagonal graph is $(9,4)$ -colorable.
opengraph-coloring multicoloring triangular-lattice-graphs
09

McDiarmid–Reed's conjecture for hexagonal graphs