Sciweavers

39
Voted
DAM
2007

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

13 years 11 months ago
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. © 2006 Elsevier B.V. All rights reserved. MSC: 05C15; 05C78
Baogang Xu, Haihui Zhang
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2007
Where DAM
Authors Baogang Xu, Haihui Zhang
Comments (0)