3-list-coloring planar graphs of girth 4

被引：2
|
作者：
Guo, Jun-Lin [1 ]
Wang, Yue-Li [1 ]
机构：
[1] Natl Taiwan Univ Sci & Technol, Dept Informat Management, Taipei, Taiwan
来源：
DISCRETE MATHEMATICS | 2011年 / 311卷 / 06期
关键词：
Choosability; Listing coloring; Planar graphs;
D O I：
10.1016/j.disc.2010.12.003
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In Thomassen (1995) [4], Thomassen proved that planar graphs of girth at least 5 are 3-choosable. In Li (2009)[3], Li improved Thomassen's result by proving that planar graphs of girth 4 with no 4-cycle sharing a vertex with another 4- or 5-cycle are 3-choosable. In this paper, we prove that planar graphs of girth 4 with no 4-cycle sharing an edge with another 4- or 5-cycle are 3-choosable. It is clear that our result strengthens Li's result. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码：413 / 417
页数：5
相关论文
共 50 条
12345