Multiple list colouring of planar graphs

设为首页

收藏本站

网站地图 | English | 公务邮箱

About the library

Background
History
Leadership
Organization

Readers' Guide

Opening Hours
Collections
Help Via Email

Publications

Electronic Information Resources

Multiple list colouring of planar graphs

详细信息查看全文

作者：Xuding Zhu¹ ; ^{xudingzhu@gmail.com}
关键词：Fractional choice number ; Multiple list colouring ; Planar graph
刊名：Journal of Combinatorial Theory, Series B
出版年：2017
出版时间：January 2017
年：2017
卷：122
期：Complete
页码：794-799
全文大小：233 K
卷排序：122

文摘

This paper proves that for each positive integer m, there is a planar graph G which is not (4m+⌊2m−19⌋,m)-choosable. Then we pose some conjectures concerning multiple list colouring of planar graphs.