[ 1 ] BONDY J A, MURTY U S R. Graph Theory[M]. Berlin: Springer, 2008.
[ 2 ] SONG H M, LAI H J, WU J L. On r-hued coloring of planar graphs with grith at least 6[J]. Discrete Appl Math,2016, 198: 251-263.
[ 3 ] CHEN Y, FAN S H, LAI H J, et al. On dynamic coloring for planar graphs and graphs of higher genus[J].Discrete Appl Math, 2012, 160: 1064-1071.
[ 4 ] 林越. 图的条件着色的上界[D]. 广州: 暨南大学, 2008.
[ 5 ] APPEL K, HAKEN W, KOCK J. Every plane map is four colorable, Part I: Discharging[J]. Illinois J Math,1977, 21: 429-490.
[ 6 ] 丁超, 樊锁海, 赖宏建, 图的条件色数的上界[J].暨南大学学报(自然科学与医学版), 2008, 29(1): 35-38. |