Proof of McDiarmid-Reed conjecture for a subclass of hexagonal graphs
Abstract
In 1999, McDiarmid and Reed in [4] asked the following question: is the ratio 9/8 of multichromatic number to weighted clique number asymptotically the worst (greatest) possible for hexagonal graphs. In this paper we give a positive answer to this question for a large class of graphs studied in [10] and [12]. © 2017 Utilitas Mathematica Publishing Inc.. All rights reserved.











