[1]  Akiyama J,  Era H, Gerracio S V, Watanabe M.  Path chromatic numbers of graphs. J Graph Theory, 1989, 13: 569--579

[2]  Chang G J,  Liu D D -F,  Zhu X D. Distance graphs and $T$-coloring. J Combin Theory (Ser B), 1999, 75: 259--269

[3]  Catlin P A,  Lai H J. Vertex arboricity and maximum degree. Discrete Math, 1995, 141: 37--46

[4] Eggleton R B,  Erdös P, Skilton D K. Colouring the real line. J Combin Theory (Ser B), 1985, 39:  86--100

[5]  Eggleton R  B,  Erdös P, Skilton D K. Colouring prime distance graphs. Graphs and Combinatorics, 1990, 6:   17--32

[6]  Goddard W. Acyclic coloring of planar graphs. Discrete Math, 1991, 91:  91--94

[7]  Jörgensen L K. Vertex partitions of K_4,4-minor free graphs. Graphs and Combin, 2001, 17: 265--274

[8]  Kemnitz A, Kolbery H. Coloring of integer distance graphs. Discrete Math, 1998, 191: 113--123

[9]  Kemnitz  A, Marangio M. Chromatic numbers of integer distance graphs. Discrete Math, 2001, 233: 239--246

[10]  Liu  D D -F, Zhu X D. Distance graphs with missing multiples in the distance sets. J Graph Theory, 1999, 30:  245--259

[11]  Skrekovski R. On the critical point-arboricity graphs.J Graph Theory,  2002, 39: 50--61

[12]  Voigt M, Walther H. Chromatic number of prime distance graphs. Discrete Applied Math, 1994, 51: 197--209

[13]  Voigt M. Colouring of distance graphs. Ars Combin, 1999, 52:  3--12

[14]  Matsumoto M. Bounds for the vertex linear arboricity. J Graph Theory, 1990, 14: 117--126

[15]  Poh K. On the linear vertex-arboricity of a planar graph. J  Graph Theory, 1990, 14: 73--75

[16]  Zuo  L C,  Wu J L, Liu J Z. The vertex linear arboricity of an integer distance graph with a special distance set.  Ars Combin, 2006, 79(2): 65--76

[17]  Zuo L C, Wu J L,  Liu J Z. The vertex linear arboricity of distance graphs. Discrete Math, 2006, 306(2): 284--289

[18]  Zuo L C, Yu Q, Wu  J L. Tree coloring of distance graphs with a real interval set. Applied Mathematics Letter, 2006, 19(12): 1341--1344

[19]  Zuo L C, Wu  J L, Liu J Z. The fractional vertex linear arboricity of graphs. Ars Combin, 2006, 81(5): 175--191

[20]   左连翠, 李霞. 整数距离图的点荫度. 山东大学学报(理学版), 2004, 39(2):   12--15

[21]  左连翠, 吴建良, 刘家壮. 整数距离图G(D_m,k,₂的点线性荫度. 系统科学与数学, 2006, 26(5): 522--532

[22]  Yu Q, Zuo L C. The fractional vertex arboricity of graphs.  Lecture Notes in Computer Science,  2007, 4381(1): 245--252

[23]  Zuo L C,   Yu Q,  Wu J L. Vertex arboricity of  integer distance graph G(D_m,_k). Discrete Math, 2009, 309(6): 1649--1657

[24]  Zhang Zhongfu, Wang Weifan, et al. Edge-face chromatic number of 2-connected plane graphs with high maximum degree. Acta Mathematica Scientia, 2006, 26B(3):  477--482