Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles

Authors:
Wei-Fan Wang;Ko-Wei Lih
Affiliations:
-;-
Venue:
SIAM Journal on Discrete Mathematics
Year:
2002

Citing 0
Cited 7

The 4-choosability of toroidal graphs without intersecting triangles

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

Discrete Applied Mathematics
On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability

European Journal of Combinatorics
On 3-choosability of planar graphs without certain cycles

Information Processing Letters
Equitable list colorings of planar graphs without short cycles

Theoretical Computer Science
Edge-choosability of planar graphs without non-induced 5-cycles

Information Processing Letters
RETRACTED ARTICLE: On 3-choosability of planar graphs with neither adjacent triangles nor 5-, 6- and 9-cycles

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let G be a planar graph without two triangles sharing a common vertex. We prove that (1) G is 4-choosable and (2) G is edge-$(\Delta(G)+1)$-choosable when its maximum degree $\Delta(G)\ne 5$.