Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Gabow, Harold N.
and
Skulrattanakulchai, San
2002.
Computing and Combinatorics.
Vol. 2387,
Issue. ,
p.
67.
SKULRATTANAKULCHAI, SAN
and
GABOW, HAROLD N.
2004.
COLORING ALGORITHMS ON SUBCUBIC GRAPHS.
International Journal of Foundations of Computer Science,
Vol. 15,
Issue. 01,
p.
21.
Akbari, S.
Alipour, A.
Fu, H. L.
and
Lo, Y. H.
2006.
Multicolored Parallelisms of Isomorphic Spanning Trees.
SIAM Journal on Discrete Mathematics,
Vol. 20,
Issue. 3,
p.
564.
Hou, Jianfeng
Liu, Guizhen
and
Wu, Jianliang
2007.
Computational Science – ICCS 2007.
Vol. 4489,
Issue. ,
p.
320.
Cranston, Daniel W.
and
Kim, Seog‐Jin
2008.
List‐coloring the square of a subcubic graph.
Journal of Graph Theory,
Vol. 57,
Issue. 1,
p.
65.
Chierichetti, Flavio
and
Vattani, Andrea
2008.
Automata, Languages and Programming.
Vol. 5125,
Issue. ,
p.
320.
Ma, Qin
Wu, Jian-Liang
and
Yu, Xiao
2009.
Planar graphs without 5-cycles or without 6-cycles.
Discrete Mathematics,
Vol. 309,
Issue. 10,
p.
2998.
Cranston, Daniel W.
2009.
Multigraphs with Δ ≥ 3 are Totally-(2Δ−1)-Choosable.
Graphs and Combinatorics,
Vol. 25,
Issue. 1,
p.
35.
Liu, Bin
Hou, Jianfeng
Wu, Jianliang
and
Liu, Guizhen
2009.
Total colorings and list total colorings of planar graphs without intersecting 4-cycles.
Discrete Mathematics,
Vol. 309,
Issue. 20,
p.
6035.
Chierichetti, Flavio
and
Vattani, Andrea
2010.
The Local Nature of List Colorings for Graphs of High Girth.
SIAM Journal on Computing,
Vol. 39,
Issue. 6,
p.
2232.
Chang, Gerard Jennhwa
Hou, Jianfeng
and
Roussel, Nicolas
2010.
On the total choosability of planar graphs and of sparse graphs.
Information Processing Letters,
Vol. 110,
Issue. 20,
p.
849.
Woodall, Douglas R.
2010.
The average degree of a multigraph critical with respect to edge or total choosability.
Discrete Mathematics,
Vol. 310,
Issue. 6-7,
p.
1167.
Liu, Bin
Hou, Jian Feng
and
Liu, Gui Zhen
2011.
List total colorings of planar graphs without triangles at small distance.
Acta Mathematica Sinica, English Series,
Vol. 27,
Issue. 12,
p.
2437.
Li, Rui
and
Xu, Baogang
2011.
Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles.
Discrete Mathematics,
Vol. 311,
Issue. 20,
p.
2158.
Roussel, Nicolas
2011.
Total choosability of planar graphs with maximum degree 4.
Discrete Applied Mathematics,
Vol. 159,
Issue. 1,
p.
87.
Chang, Gerard J.
and
Roussel, Nicolas
2012.
(Δ+1)-total choosability of planar graphs with no cycles of length from 4 to k and without close triangles.
Discrete Mathematics,
Vol. 312,
Issue. 14,
p.
2126.
Zhang, Xin
Wu, Jianliang
and
Liu, Guizhen
2012.
List edge and list total coloring of 1-planar graphs.
Frontiers of Mathematics in China,
Vol. 7,
Issue. 5,
p.
1005.
Lai, H. J.
Omidi, G. R.
and
Raeisi, G.
2013.
On Group Choosability of Total Graphs.
Graphs and Combinatorics,
Vol. 29,
Issue. 3,
p.
585.
Zhang, Xin
2013.
List total coloring of pseudo-outerplanar graphs.
Discrete Mathematics,
Vol. 313,
Issue. 20,
p.
2297.
Lu, Qiuli
Miao, Zhengke
and
Wang, Yingqian
2013.
Sufficient conditions for a planar graph to be list edgeΔ-colorable and list totally(Δ+1)-colorable.
Discrete Mathematics,
Vol. 313,
Issue. 5,
p.
575.