PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Wu, Jianliang"

Author of the publication

copydeleteadd this publication to your clipboard
Graphs are (1, Δ+1)-choosable.

, , , , , , and . Discrete Mathematics, 342 (1): 279-284 (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jingcheng Wu University of Stuttgart

Hanchuan Wu University of Stuttgart

Yongxiang Wu University of Stuttgart

PD Dr. phil. Joachim Wündisch University of Stuttgart

Prof. iR Dr. Günter Wunner University of Stuttgart

 

Other publications of authors with the same name

Minimum number of disjoint linear forests covering a planar graph., , , and . J. Comb. Optim., 28 (1): 274-287 (2014)Total coloring of planar graphs with maximum degree 7., and . Inf. Process. Lett., 111 (20): 1019-1021 (2011)On the linear arboricity of graphs embeddable in surfaces., , , and . Inf. Process. Lett., 114 (9): 475-479 (2014)Circular vertex arboricity., , , and . Discrete Applied Mathematics, 159 (12): 1231-1238 (2011)A note on Edge Weight choosability of graphs., , , and . Discrete Math., Alg. and Appl., (2014)1-s2.0-S0012365X11004973-si1-forested choosability of planar graphs and sparse graphs., , and . Discrete Mathematics, 312 (5): 999-1005 (2012)The vertex linear arboricity of distance graphs., , and . Discrete Mathematics, 306 (2): 284-289 (2006)An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree., , and . Discrete Mathematics, 271 (1-3): 321-325 (2003)Total coloring of planar graphs without short cycles., , and . J. Comb. Optim., 31 (4): 1650-1664 (2016)A conjecture on equitable vertex arboricity of graphs, and . CoRR, (2012)