List coloring and diagonal coloring for plane graphs of diameter two

作者:

Highlights:

摘要

Let G be a maximal plane graph of diameter at most two. Let χl(G) and χd(G) denote the list chromatic number and the diagonal chromatic number of G, respectively. In this paper, we study the structure of G and show the following results: (1) χl(G) ≤ 4; and (2) χd(G) ≤ 9, and χd(G)=9 if and only if G is a specific graph on nine vertices.

论文关键词:Plane graph of diameter two,List coloring,Diagonal coloring

论文评审过程:Received 18 January 2019, Revised 7 April 2019, Accepted 1 July 2019, Available online 22 July 2019, Version of Record 22 July 2019.

论文官网地址:https://doi.org/10.1016/j.amc.2019.124562