Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Juvan, Martin
Mohar, Bojan
and
Sˇkrekovski, Riste
1998.
On list edge-colorings of subcubic graphs.
Discrete Mathematics,
Vol. 187,
Issue. 1-3,
p.
137.
Juvan, Martin
Mohar, Bojan
and
??krekovski, Riste
1999.
Graphs of degree 4 are 5-edge-choosable.
Journal of Graph Theory,
Vol. 32,
Issue. 3,
p.
250.
Weifan, Wang
and
Lih, Ko-Wei
2001.
Choosability, Edge Choosability, and Total Choosability of Outerplane Graphs.
European Journal of Combinatorics,
Vol. 22,
Issue. 1,
p.
71.
Kostochka, Alexandr V.
and
Woodall, Douglas R.
2002.
Total choosability of multicircuits II.
Journal of Graph Theory,
Vol. 40,
Issue. 1,
p.
44.
Wang, Wei-Fan
and
Lih, Ko-Wei
2002.
Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles.
SIAM Journal on Discrete Mathematics,
Vol. 15,
Issue. 4,
p.
538.
Zhang, Li
and
Wu, Baoyindureng
2004.
Edge choosability of planar graphs without small cycles.
Discrete Mathematics,
Vol. 283,
Issue. 1-3,
p.
289.
Alon, Noga
and
Asodi, Vera
2004.
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques.
Vol. 3122,
Issue. ,
p.
237.
Maistrelli, E.
and
Penman, D.B.
2006.
Some colouring problems for Paley graphs.
Discrete Mathematics,
Vol. 306,
Issue. 1,
p.
99.
Hou, Jianfeng
Liu, Guizhen
and
Cai, Jiansheng
2006.
List edge and list total colorings of planar graphs without 4-cycles.
Theoretical Computer Science,
Vol. 369,
Issue. 1-3,
p.
250.
Wang, Wei-Fan
and
Lih, Ko-Wei
2007.
On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability.
European Journal of Combinatorics,
Vol. 28,
Issue. 1,
p.
111.
Hou, Jianfeng
Liu, Guizhen
and
Wu, Jianliang
2007.
Computational Science – ICCS 2007.
Vol. 4489,
Issue. ,
p.
320.
Liu, Bin
Hou, Jianfeng
and
Liu, Guizhen
2008.
List edge and list total colorings of planar graphs without short cycles.
Information Processing Letters,
Vol. 108,
Issue. 6,
p.
347.
Shen, Yufa
Zheng, Guoping
He, Wenjie
and
Zhao, Yongqiang
2008.
Structural properties and edge choosability of planar graphs without 4-cycles.
Discrete Mathematics,
Vol. 308,
Issue. 23,
p.
5789.
Cariolaro, David
and
Lih, Ko-Wei
2008.
92.80 The edge-choosability of the tetrahedron.
The Mathematical Gazette,
Vol. 92,
Issue. 525,
p.
543.
Cai, Jiansheng
Hou, Jianfeng
Zhang, Xia
and
Liu, Guizhen
2009.
Edge-choosability of planar graphs without non-induced 5-cycles.
Information Processing Letters,
Vol. 109,
Issue. 7,
p.
343.
Chen, Yongzhu
Zhu, Weiyi
and
Wang, Weifan
2009.
Edge choosability of planar graphs without 5-cycles with a chord.
Discrete Mathematics,
Vol. 309,
Issue. 8,
p.
2233.
Wu, Baoyindureng
and
An, Xinhui
2009.
Combinatorial Optimization and Applications.
Vol. 5573,
Issue. ,
p.
249.
Hou, Jianfeng
Liu, Guizhen
and
Cai, Jiansheng
2009.
Edge-choosability of planar graphs without adjacent triangles or without 7-cycles.
Discrete Mathematics,
Vol. 309,
Issue. 1,
p.
77.
Füredi, Zoltán
and
Lehel, Jenő
2010.
Tight embeddings of partial quadrilateral packings.
Journal of Combinatorial Theory, Series A,
Vol. 117,
Issue. 4,
p.
466.
Cohen, Nathann
and
Havet, Frédéric
2010.
Planar graphs with maximum degree Δ≥9 are (Δ+1)-edge-choosable—A short proof.
Discrete Mathematics,
Vol. 310,
Issue. 21,
p.
3049.