A note on 3-choosability of plane graphs under distance restrictions

作者：Jing, Jin; Yiming, Wei

来源：Discrete Mathematics, Algorithms and Applications, 2017, 09(01): 1750011.

DOI：10.1142/s1793830917500112

<jats:p> A graph [Formula: see text] is [Formula: see text]-choosable if it has an [Formula: see text]-coloring whenever [Formula: see text] is a list assignment such that [Formula: see text] for all [Formula: see text]. We provide two sufficient conditions for 3-choosability of plane graphs. Every plane graph with [Formula: see text] without cycles of length from 4 to 6 and special 7-cycles is 3-choosable. Every plane graph with [Formula: see text] without cycles of length from 4 to 5 and adjacent 6-cycles is also 3-choosable. </jats:p>

• 出版日期2017-2
• 单位南京师范大学