Hits :

Affiliation of Author(s): 数理与信息工程学院

Date of Publication : 2007-01-01

Document Type : 期刊

Journal : Taiwanese Journal of Mathematics

Volume: Vol.11

Issue : NO.1

Translation or Not : no

Key Words : Planar;Graphs;Short;Cycles;Chords

Abstract : In this paper we prove that every planar graph G is 3-choosable if it contains no cycle of length at most 10 with a chord. This generalizes a result obtained by Borodin [J. Graph Theory 21(1996) 183-186] and S...