Sie haben Javascript deaktiviert!
Sie haben versucht eine Funktion zu nutzen, die nur mit Javascript möglich ist. Um sämtliche Funktionalitäten unserer Internetseite zu nutzen, aktivieren Sie bitte Javascript in Ihrem Browser.

Show image information
Show image information
Show image information
Show image information
Discrete Mathematics / Graph Theory
Prof. Dr. Eckhard Steffen

Yingli Kang

 Yingli Kang

International Graduate School Dynamic Intelligent Systems

Research Student

+49 5251 60-6685
Fürstenallee 11
33102 Paderborn
Postal Address:
Warburger Str. 100
33098 Paderborn


Jin L, Kang Y, Steffen E. Choosability in signed planar graphs[J]. European Journal of Combinatorics, 2016, 52: 234-243.

Jin L, Kang Y, Steffen E. Face-degree bounds for planar critical graphs[J]. The Electronic Journal of Combinatorics, 2016, 23(3): P3. 21.

Jin L, Kang Y, Steffen E. Remarks on planar edge-chromatic critical graphs[J]. Discrete Applied Mathematics, 2016, 200: 200-202.

Kang Y, Steffen E. The chromatic spectrum of signed graphs[J]. Discrete Mathematics, 2016, 339(11): 2660-2663.

Kang Y, Steffen E. Circular coloring of signed graphs[J]. arXiv preprint arXiv:1509.04488, 2015.

Kang Y, Wang Y. Distance Constraints on Short Cycles for 3-Colorability of Planar graphs[J]. Graphs and Combinatorics, 2015, 31(5): 1497-1505.

Wang Y, Jin L, Kang Y. Planar graphs without cycles of length from 4 to 6 are (1, 0, 0)-colorable[J]. Sci. Sin. Math, 2013, 43: 1145-1164.

Kang Y L, Wang Y Q. A sufficient condition for a planar graph to be 3-colorable (in Chinese). Sci Sin Math,

2013, 43: 409–421, doi: 10.1360/012012-253.

Zhang Y, Jin L, Kang Y. Generalized Wronskian solutions for the (3+ 1)-dimensional Jimbo–Miwa equation[J]. Applied Mathematics and Computation, 2012, 219(5): 2601-2610.


The University for the Information Society