The 4-choosability of toroidal graphs without intersecting triangles

Authors:
Luo Xiaofang
Affiliations:
Yiwu Industrial and Commercial College, Zhejiang, Yiwu 322000, China
Venue:
Information Processing Letters
Year:
2007

Citing 4
Cited 0

List colourings of planar graphs

Discrete Mathematics
Every planar graph is 5-choosable

Journal of Combinatorial Theory Series B
Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles

SIAM Journal on Discrete Mathematics
Dirac's map-color theorem for choosability

Journal of Graph Theory

Quantified Score

Hi-index	0.89

Visualization

Abstract

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.