Current position: Home >> Scientific research >> Paper achievements

Yang Daqing

Personal Information

教授

Paper achievements

[1]Extensions of matroid covering and packing.European Journal of Combinatorics.2019,Vol.76:117-122
[2]Decomposing a graph into forests and a matching.Journal of Combinatorial Theory, Series B.2018,Vol.131:40-54
[3]Decomposing a graph into forests: the Nine Dragon Tree Conjecture is true.Combinatorica.2017,37(6):1125-1137
[4]Strong Chromatic Index of Sparse Graphs.Journal of Graph Theory.2016,Vol.83(No.4):334-339
[5]Decomposing a graph into pseudoforests with one having bounded degree.Journal of Combinatorial Theory - Series B.2015,115:72-95
[6]On total weight choosability of graphs.Journal of Combinatorial Optimization.2013,25(4):766~783
[7]Coloring games on squares of graphs.Discrete Mathematics.2012,312(8):1400~1406
[8]Game colouring directed graphs.Electronic Journal of Combinatorics.2010,17(1):R11-1~R11-19
[9]The two-coloring number and degenerate colorings of planar graphs.SIAM Journal on Discrete Mathematics.2009,23(3):1548~1560
[10]Generalization of transitive fraternal augmentations for directed graphs and its applications.Discrete Mathematics.2009,309(13):4614~4623

total10 1/1

firstpreviousnextlast