Proof of McDiarmid-Reed conjecture for a subclass of hexagonal graphs

Authors

  • Witkowski, Rafal
  • Zerovnik, Janez

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.

Published

2017-11-09

How to Cite

Witkowski, Rafal, & Zerovnik, Janez. (2017). Proof of McDiarmid-Reed conjecture for a subclass of hexagonal graphs. Utilitas Mathematica, 105. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/1168

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.