2010
DOI: 10.1016/j.ipl.2010.09.006
|View full text |Cite|
|
Sign up to set email alerts
|

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

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 20 publications
0
1
0
Order By: Relevance
“…Every planar graph without 3-, 7-and 8-cycles is DP-3-colorable Zhang and Wu [34] showed that every planar graph without 4-, 5-, 6-and 9-cycles is 3-choosable. Zhang [29] generalized this result by showing that every planar graph with neither adjacent triangles nor 5-, 6and 9-cycles is 3-choosable. Liu et al [17] showed that every planar graph without 4-, 5-, 6-and 9-cycles is DP-3-colorable.…”
Section: Introductionmentioning
confidence: 99%
“…Every planar graph without 3-, 7-and 8-cycles is DP-3-colorable Zhang and Wu [34] showed that every planar graph without 4-, 5-, 6-and 9-cycles is 3-choosable. Zhang [29] generalized this result by showing that every planar graph with neither adjacent triangles nor 5-, 6and 9-cycles is 3-choosable. Liu et al [17] showed that every planar graph without 4-, 5-, 6-and 9-cycles is DP-3-colorable.…”
Section: Introductionmentioning
confidence: 99%