Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Lih, Ko-Wei
Song, Zengmin
Wang, Weifan
and
Zhang, Kemin
2001.
A note on list improper coloring planar graphs.
Applied Mathematics Letters,
Vol. 14,
Issue. 3,
p.
269.
Havet, Frédéric
and
Sereni, Jean‐Sébastien
2006.
Improper choosability of graphs and maximum average degree.
Journal of Graph Theory,
Vol. 52,
Issue. 3,
p.
181.
Chen, Yongzhu
Zhu, Weiyi
and
Wang, Weifan
2008.
Improper choosability of graphs of nonnegative characteristic.
Computers & Mathematics with Applications,
Vol. 56,
Issue. 8,
p.
2073.
Dong, Wei
and
Xu, Baogang
2009.
A note on list improper coloring of plane graphs.
Discrete Applied Mathematics,
Vol. 157,
Issue. 2,
p.
433.
DONG, WEI
and
XU, BAOGANG
2009.
ON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHS.
Discrete Mathematics, Algorithms and Applications,
Vol. 01,
Issue. 02,
p.
291.
Wang, Weifan
and
Bu, Yuehua
2013.
Handbook of Combinatorial Optimization.
p.
2095.
Wang, Yingqian
and
Xu, Jinghan
2013.
Planar graphs with cycles of length neither 4 nor 6 are -colorable.
Information Processing Letters,
Vol. 113,
Issue. 18,
p.
659.
Chen, Min
and
Raspaud, André
2013.
(3, 1)*-choosability of planar graphs without adjacent short cycles.
Electronic Notes in Discrete Mathematics,
Vol. 43,
Issue. ,
p.
221.
Wang, Yingqian
and
Xu, Lingji
2013.
Improper Choosability of Planar Graphs without 4-Cycles.
SIAM Journal on Discrete Mathematics,
Vol. 27,
Issue. 4,
p.
2029.
2013.
Improper Choosability and Property B.
Journal of Graph Theory,
Vol. 73,
Issue. 3,
p.
342.
Chen, Min
and
Raspaud, André
2014.
On(3,1)∗-choosability of planar graphs without adjacent short cycles.
Discrete Applied Mathematics,
Vol. 162,
Issue. ,
p.
159.
Wang, Yingqian
and
Xu, Jinghan
2015.
Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph.
European Journal of Combinatorics,
Vol. 43,
Issue. ,
p.
98.
ZHANG, HAIHUI
2016.
(3, 1)*-Choosability of graphs of nonnegative characteristic without intersecting short cycles.
Proceedings - Mathematical Sciences,
Vol. 126,
Issue. 2,
p.
159.
Chen, Min
Raspaud, André
and
Wang, Weifan
2016.
A $$(3,1)^{*}$$ ( 3 , 1 ) ∗ -choosable theorem on planar graphs.
Journal of Combinatorial Optimization,
Vol. 32,
Issue. 3,
p.
927.
张, 倩
2019.
(3, 1)<sup>?</sup>-Choosability of Planar Graphs without Adjacent Short Cycles.
Advances in Applied Mathematics,
Vol. 08,
Issue. 09,
p.
1574.
Chen, Min
and
Raspaud, André
2019.
Acyclic improper choosability of subcubic graphs.
Applied Mathematics and Computation,
Vol. 356,
Issue. ,
p.
92.