1 problem

McDiarmid–Reed's conjecture for hexagonal graphs
arXiv@arxiv
McDiarmid–Reed's conjecture. Every hexagonal graph is $(9,4)$ -colorable.
Conjectureopengraph-coloring multicoloring triangular-lattice-graphs
0