Every toroidal graph without adjacent triangles is (4, 1)*-choosable

In this paper, a structural theorem about toroidal graphs is given that strengthens a result of Borodin on plane graphs. As a consequence, it is proved that every toroidal graph without adjacent triangles is (4, 1)*-choosable. This result is best possible in the sense that K7 is a non-(3, 1)*-choosable toroidal graph. A linear time algorithm for producing such a coloring is presented also.

[1]  Bojan Mohar,et al.  Light subgraphs in planar graphs of minimum degree 4 and edge-degree 9 , 2003, J. Graph Theory.

[2]  Thomas C. Hull,et al.  Defective List Colorings of Planar Graphs , 1997 .

[3]  Stanislav Jendrol',et al.  On vertex types and cyclic colourings of 3-connected plane graphs , 2000, Discret. Math..

[4]  Ko-Wei Lih,et al.  A note on list improper coloring planar graphs , 2001, Appl. Math. Lett..

[5]  Hikoe Enomoto,et al.  Contractible edges in 3-connected graphs , 1987, J. Comb. Theory, Ser. B.

[6]  Baogang Xu,et al.  On structure of graphs embedded on surfaces of nonnegative characteristic with application to choosability , 2002, Discret. Math..

[7]  Yue Zhao,et al.  On cyclic colorings and their generalizations , 1999, Discret. Math..

[8]  Peter L. Hammer,et al.  Discrete Applied Mathematics , 1993 .

[9]  Bojan Mohar,et al.  A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface , 1999, SIAM J. Discret. Math..

[10]  Baogang Xu,et al.  On Structure of Some Plane Graphs with Application to Choosability , 2001, J. Comb. Theory B.

[11]  Xu Baogang.  (4m, m)-CHOOSABILITY OF PLANE GRAPHS , 2001 .

[12]  Riste Skrekovski.  List improper colorings of planar graphs with prescribed girth , 2000, Discret. Math..

[13]  Riste Škrekovski.  List Improper Colourings of Planar Graphs , 1999 .

[14]  Oleg V. Borodin,et al.  Structural properties of plane graphs without adjacent triangles and an application to 3-colorings , 1996, J. Graph Theory.

[15]  Ko-Wei Lih,et al.  Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles , 2002, SIAM J. Discret. Math..