Skip to content

Opening book details…

Can I read The 4-Choosability of Toroidal Graphs Without Intersecting Triangles on EtoBox?

The 4-Choosability of Toroidal Graphs Without Intersecting Triangles by Luo Xiaofang is a Computer Science article available to read on EtoBox.

What is The 4-Choosability of Toroidal Graphs Without Intersecting Triangles about?

In this paper we prove that every toroidal graph without two triangles sharing a common vertex is 4-choosable. This generalizes a result by Wang and Lih [W. Wang, K.-W. Lih, Choosability and edge choosability of planar graphs without intersecting triangles, SIAM J. Discrete Math. 15 (2002) 538-545], which says that every planar graph without triangles sharing a common vertex is 4-choosable.

Who reads The 4-Choosability of Toroidal Graphs Without Intersecting Triangles?

It is typically read by researchers, students, and practitioners in Computer Science.

Author
Luo Xiaofang
Publisher
Elsevier Science; Elsevier ; Elsevier BV (ISSN 0020-0190)
Published
2007
Language
EN
Field
Computer Science (Physical Sciences)

More by Luo Xiaofang

Browse all works by Luo Xiaofang