×

zbMATH — the first resource for mathematics

Yu, Gexin

Compute Distance To:
Author ID: yu.gexin Recent zbMATH articles by "Yu, Gexin"
Published as: Yu, G.; Yu, Gexin
External Links: ORCID
Documents Indexed: 82 Publications since 1993

Publications by Year

Citations contained in zbMATH

65 Publications have been cited 435 times in 296 Documents Cited by Year
Ore-condition and \(Z_3\)-connectivity. Zbl 1171.05029
Luo, Rong; Xu, Rui; Yin, Jianhua; Yu, Gexin
33
2008
On sufficient degree conditions for a graph to be \(k\)-linked. Zbl 1109.05061
Kawarabayashi, Ken-ichi; Kostochka, Alexandr; Yu, Gexin
27
2006
Nowhere-zero \(Z_3\)-flows through \(Z_3\)-connectivity. Zbl 1086.05043
DeVos, Matt; Xu, Rui; Yu, Gexin
26
2006
Injective colorings of sparse graphs. Zbl 1209.05075
Cranston, Daniel W.; Kim, Seog-Jin; Yu, Gexin
22
2010
Injective colorings of graphs with low average degree. Zbl 1218.05046
Cranston, Daniel W.; Kim, Seog-Jin; Yu, Gexin
21
2011
Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable. Zbl 1281.05055
Hill, Owen; Smith, Diana; Wang, Yingqian; Xu, Lingji; Yu, Gexin
16
2013
Hamiltonian connectedness in 3-connected line graphs. Zbl 1169.05344
Lai, Hong-Jian; Shao, Yehong; Yu, Gexin; Zhan, Mingquan
16
2009
Decomposing a planar graph with girth 9 into a forest and a matching. Zbl 1144.05019
Borodin, Oleg V.; Kostochka, Alexandr V.; Sheikh, Naeem N.; Yu, Gexin
15
2008
Strong chromatic index of subcubic planar multigraphs. Zbl 1321.05123
Kostochka, A. V.; Li, X.; Ruksasakchai, W.; Santana, M.; Wang, T.; Yu, G.
13
2016
An extremal problem for \(H\)-linked graphs. Zbl 1078.05042
Kostochka, Alexandr; Yu, Gexin
13
2005
Min-max optimization of several classical discrete optimization problems. Zbl 0908.90220
Yu, G.
12
1998
A relaxation of Steinberg’s conjecture. Zbl 1268.05074
Hill, Owen; Yu, Gexin
11
2013
A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid. Zbl 1186.05070
Cranston, Daniel W.; Yu, Gexin
11
2009
Extremal graph packing problems: Ore-type versus Dirac-type. Zbl 1182.05064
Kierstead, H. A.; Kostochka, A. V.; Yu, Gexin
11
2009
Ore-type graph packing problems. Zbl 1122.05081
Kostochka, A. V.; Yu, G.
11
2007
An extremal problem on group connectivity of graphs. Zbl 1242.05133
Luo, Rong; Xu, Rui; Yu, Gexin
10
2012
Linear choosability of sparse graphs. Zbl 1225.05095
Cranston, Daniel W.; Yu, Gexin
9
2011
On minimum degree implying that a graph is \(H\)-linked. Zbl 1127.05059
Gould, Ronald J.; Kostochka, Alexandr; Yu, Gexin
9
2006
Strong edge-colorings for \(k\)-degenerate graphs. Zbl 1321.05096
Yu, Gexin
8
2015
New bounds on the minimum density of an identifying code for the infinite hexagonal grid. Zbl 1287.05065
Cukierman, Ari; Yu, Gexin
8
2013
DP-3-coloring of some planar graphs. Zbl 1400.05086
Liu, Runrun; Loeb, Sarah; Yin, Yuxue; Yu, Gexin
7
2019
Graphs containing every 2-factor. Zbl 1256.05118
Kostochka, Alexandr V.; Yu, Gexin
7
2012
On the first-fit chromatic number of graphs. Zbl 1180.05042
Balogh, József; Hartke, Stephen G.; Liu, Qi; Yu, Gexin
7
2008
Two-particle diffusion and locality assumption. Zbl 1186.76395
Nicolleau, F.; Yu, G.
7
2004
Strong chromatic index of graphs with maximum degree four. Zbl 1395.05057
Huang, Mingfang; Santana, Michael; Yu, Gexin
6
2018
Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable. Zbl 1327.05117
Liu, Runrun; Li, Xiangwen; Yu, Gexin
6
2016
Minimum degree conditions for \(H\)-linked graphs. Zbl 1144.05039
Kostochka, Alexandr; Yu, Gexin
6
2008
A relaxation of the Bordeaux conjecture. Zbl 1315.05059
Liu, Runrun; Li, Xiangwen; Yu, Gexin
5
2015
On a graph packing conjecture by Bollobás, Eldridge and Catlin. Zbl 1212.05132
Kaul, Hemanshu; Kostochka, Alexandr; Yu, Gexin
5
2008
An inequality for the group chromatic number of a graph. Zbl 1127.05041
Lai, Hong-Jian; Li, Xiangwen; Yu, Gexin
5
2007
Strong list-chromatic index of subcubic graphs. Zbl 1397.05062
Dai, Tianjiao; Wang, Guanghui; Yang, Donglei; Yu, Gexin
4
2018
A relaxation of the strong Bordeaux conjecture. Zbl 1396.05030
Huang, Ziwen; Li, Xiangwen; Yu, Gexin
4
2018
The strong chromatic index of \((3,\Delta)\)-bipartite graphs. Zbl 1357.05043
Huang, Mingfang; Yu, Gexin; Zhou, Xiangqian
4
2017
Permutations as product of parallel transpositions. Zbl 1237.05002
Albert, Chase; Li, Chi-Kwong; Strang, Gilbert; Yu, Gexin
4
2011
An Ore-type analogue of the Sauer-Spencer theorem. Zbl 1125.05081
Kostochka, Alexandr; Yu, Gexin
4
2007
Covering 2-connected 3-regular graphs with disjoint paths. Zbl 1393.05218
Yu, Gexin
3
2018
Maximum average degree and relaxed coloring. Zbl 1367.05075
Kopreski, Michael; Yu, Gexin
3
2017
Optimal open-locating-dominating sets in infinite triangular grids. Zbl 1317.05138
Kincaid, Rex; Oldham, Allison; Yu, Gexin
3
2015
Linkage for the diamond and the path with four vertices. Zbl 1244.05128
Ellingham, M. N.; Plummer, Michael D.; Yu, Gexin
3
2012
Equitable coloring of sparse planar graphs. Zbl 1221.05088
Luo, Rong; Sereni, Jean-Sébastien; Stephens, D. Christopher; Yu, Gexin
3
2010
On the pagenumber of \(k\)-trees. Zbl 1207.05101
Vandenbussche, Jennifer; West, Douglas B.; Yu, Gexin
3
2009
Ore-type degree conditions for a graph to be \(H\)-linked. Zbl 1143.05049
Kostochka, Alexandr V.; Yu, Gexin
3
2008
DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\). Zbl 1416.05113
Liu, Runrun; Loeb, Sarah; Rolek, Martin; Yin, Yuxue; Yu, Gexin
2
2019
Connectivities for \(k\)-knitted graphs and for minimal counterexamples to Hadwiger’s conjecture. Zbl 1301.05199
Kawarabayashi, Ken-ichi; Yu, Gexin
2
2013
Ore-type conditions implying 2-factors consisting of short cycles. Zbl 1213.05213
Kostochka, Alexandr V.; Yu, Gexin
2
2009
Implications among linkage properties in graphs. Zbl 1182.05074
Liu, Qi; West, Douglas B.; Yu, Gexin
2
2009
\(M\)-degrees of quadrangle-free planar graphs. Zbl 1161.05024
Borodin, Oleg V.; Kostochka, Alexandr V.; Sheikh, Naeem N.; Yu, Gexin
2
2009
Kinematic simulation for stably stratified and rotating turbulence. Zbl 1135.76028
Nicolleau, F.; Yu, G.; Vassilicos, J. C.
2
2008
On extremal matrices of second largest exponent by Boolean rank. Zbl 1122.15002
Liu, Bolian; You, Lihua; Yu, Gexin
2
2007
Direct computational simulations for internal condensing flows and results on attainability/stability of steady solutions, their intrinsic waviness, and their noise sensitivity. Zbl 1111.74574
Narain, A.; Liang, Q.; Yu, G.; Wang, X.
2
2004
Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs. Zbl 1442.05063
Liu, Runrun; Liu, Xujun; Rolek, Martin; Yu, Gexin
1
2020
DP-4-colorability of planar graphs without adjacent cycles of given length. Zbl 1435.05080
Liu, Runrun; Li, Xiangwen; Nakprasit, Kittikorn; Sittitrai, Pongpat; Yu, Gexin
1
2020
The strong edge-coloring for graphs with small edge weight. Zbl 1433.05113
Chen, Lily; Huang, Mingfang; Yu, Gexin; Zhou, Xiangqian
1
2020
Recent progress on strong edge-coloring of graphs. Zbl 1426.05040
Deng, Kecai; Yu, Gexin; Zhou, Xiangqian
1
2019
Planar graphs with girth at least 5 are \((3, 4)\)-colorable. Zbl 1422.05035
Choi, Ilkyoo; Yu, Gexin; Zhang, Xia
1
2019
DP-4-colorability of two classes of planar graphs. Zbl 1419.05068
Chen, Lily; Liu, Runrun; Yu, Gexin; Zhao, Ren; Zhou, Xiangqian
1
2019
Strong edge-coloring for planar graphs with large girth. Zbl 1400.05081
Chen, Lily; Deng, Kecai; Yu, Gexin; Zhou, Xiangqian
1
2019
On strong edge-coloring of graphs with maximum degree 4. Zbl 1375.05099
Lv, Jian-Bo; Li, Xiangwen; Yu, Gexin
1
2018
A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation. Zbl 1362.05007
van Zuylen, Anke; Bieron, James; Schalekamp, Frans; Yu, Gexin
1
2016
Linear colorings of subcubic graphs. Zbl 1285.05065
Liu, Chun-Hung; Yu, Gexin
1
2013
Equitable defective coloring of sparse planar graphs. Zbl 1237.05088
Williams, Lee; Vandenbussche, Jennifer; Yu, Gexin
1
2012
Packing of graphs with small product of sizes. Zbl 1204.05078
Kostochka, Alexandr V.; Yu, Gexin
1
2008
A dynamical model for turbulence. IX: Reynolds stresses for shear-driven flows. Zbl 1147.76351
Canuto, V. M.; Dubovikov, M. S.; Yu, G.
1
1999
A dynamical model for turbulence. VIII: IR and UV Reynolds stress spectra for shear-driven flows. Zbl 1147.76350
Canuto, V. M.; Dubovikov, M. S.; Yu, G.
1
1999
A finite element approach to global-local modeling in composite laminate analysis. Zbl 0900.73797
Yu, G.; Tzeng, Guang-Yau; Chaturvedi, S.; Adeli, H.; Zhang, Shao Qing
1
1995
Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs. Zbl 1442.05063
Liu, Runrun; Liu, Xujun; Rolek, Martin; Yu, Gexin
1
2020
DP-4-colorability of planar graphs without adjacent cycles of given length. Zbl 1435.05080
Liu, Runrun; Li, Xiangwen; Nakprasit, Kittikorn; Sittitrai, Pongpat; Yu, Gexin
1
2020
The strong edge-coloring for graphs with small edge weight. Zbl 1433.05113
Chen, Lily; Huang, Mingfang; Yu, Gexin; Zhou, Xiangqian
1
2020
DP-3-coloring of some planar graphs. Zbl 1400.05086
Liu, Runrun; Loeb, Sarah; Yin, Yuxue; Yu, Gexin
7
2019
DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\). Zbl 1416.05113
Liu, Runrun; Loeb, Sarah; Rolek, Martin; Yin, Yuxue; Yu, Gexin
2
2019
Recent progress on strong edge-coloring of graphs. Zbl 1426.05040
Deng, Kecai; Yu, Gexin; Zhou, Xiangqian
1
2019
Planar graphs with girth at least 5 are \((3, 4)\)-colorable. Zbl 1422.05035
Choi, Ilkyoo; Yu, Gexin; Zhang, Xia
1
2019
DP-4-colorability of two classes of planar graphs. Zbl 1419.05068
Chen, Lily; Liu, Runrun; Yu, Gexin; Zhao, Ren; Zhou, Xiangqian
1
2019
Strong edge-coloring for planar graphs with large girth. Zbl 1400.05081
Chen, Lily; Deng, Kecai; Yu, Gexin; Zhou, Xiangqian
1
2019
Strong chromatic index of graphs with maximum degree four. Zbl 1395.05057
Huang, Mingfang; Santana, Michael; Yu, Gexin
6
2018
Strong list-chromatic index of subcubic graphs. Zbl 1397.05062
Dai, Tianjiao; Wang, Guanghui; Yang, Donglei; Yu, Gexin
4
2018
A relaxation of the strong Bordeaux conjecture. Zbl 1396.05030
Huang, Ziwen; Li, Xiangwen; Yu, Gexin
4
2018
Covering 2-connected 3-regular graphs with disjoint paths. Zbl 1393.05218
Yu, Gexin
3
2018
On strong edge-coloring of graphs with maximum degree 4. Zbl 1375.05099
Lv, Jian-Bo; Li, Xiangwen; Yu, Gexin
1
2018
The strong chromatic index of \((3,\Delta)\)-bipartite graphs. Zbl 1357.05043
Huang, Mingfang; Yu, Gexin; Zhou, Xiangqian
4
2017
Maximum average degree and relaxed coloring. Zbl 1367.05075
Kopreski, Michael; Yu, Gexin
3
2017
Strong chromatic index of subcubic planar multigraphs. Zbl 1321.05123
Kostochka, A. V.; Li, X.; Ruksasakchai, W.; Santana, M.; Wang, T.; Yu, G.
13
2016
Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable. Zbl 1327.05117
Liu, Runrun; Li, Xiangwen; Yu, Gexin
6
2016
A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation. Zbl 1362.05007
van Zuylen, Anke; Bieron, James; Schalekamp, Frans; Yu, Gexin
1
2016
Strong edge-colorings for \(k\)-degenerate graphs. Zbl 1321.05096
Yu, Gexin
8
2015
A relaxation of the Bordeaux conjecture. Zbl 1315.05059
Liu, Runrun; Li, Xiangwen; Yu, Gexin
5
2015
Optimal open-locating-dominating sets in infinite triangular grids. Zbl 1317.05138
Kincaid, Rex; Oldham, Allison; Yu, Gexin
3
2015
Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable. Zbl 1281.05055
Hill, Owen; Smith, Diana; Wang, Yingqian; Xu, Lingji; Yu, Gexin
16
2013
A relaxation of Steinberg’s conjecture. Zbl 1268.05074
Hill, Owen; Yu, Gexin
11
2013
New bounds on the minimum density of an identifying code for the infinite hexagonal grid. Zbl 1287.05065
Cukierman, Ari; Yu, Gexin
8
2013
Connectivities for \(k\)-knitted graphs and for minimal counterexamples to Hadwiger’s conjecture. Zbl 1301.05199
Kawarabayashi, Ken-ichi; Yu, Gexin
2
2013
Linear colorings of subcubic graphs. Zbl 1285.05065
Liu, Chun-Hung; Yu, Gexin
1
2013
An extremal problem on group connectivity of graphs. Zbl 1242.05133
Luo, Rong; Xu, Rui; Yu, Gexin
10
2012
Graphs containing every 2-factor. Zbl 1256.05118
Kostochka, Alexandr V.; Yu, Gexin
7
2012
Linkage for the diamond and the path with four vertices. Zbl 1244.05128
Ellingham, M. N.; Plummer, Michael D.; Yu, Gexin
3
2012
Equitable defective coloring of sparse planar graphs. Zbl 1237.05088
Williams, Lee; Vandenbussche, Jennifer; Yu, Gexin
1
2012
Injective colorings of graphs with low average degree. Zbl 1218.05046
Cranston, Daniel W.; Kim, Seog-Jin; Yu, Gexin
21
2011
Linear choosability of sparse graphs. Zbl 1225.05095
Cranston, Daniel W.; Yu, Gexin
9
2011
Permutations as product of parallel transpositions. Zbl 1237.05002
Albert, Chase; Li, Chi-Kwong; Strang, Gilbert; Yu, Gexin
4
2011
Injective colorings of sparse graphs. Zbl 1209.05075
Cranston, Daniel W.; Kim, Seog-Jin; Yu, Gexin
22
2010
Equitable coloring of sparse planar graphs. Zbl 1221.05088
Luo, Rong; Sereni, Jean-Sébastien; Stephens, D. Christopher; Yu, Gexin
3
2010
Hamiltonian connectedness in 3-connected line graphs. Zbl 1169.05344
Lai, Hong-Jian; Shao, Yehong; Yu, Gexin; Zhan, Mingquan
16
2009
A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid. Zbl 1186.05070
Cranston, Daniel W.; Yu, Gexin
11
2009
Extremal graph packing problems: Ore-type versus Dirac-type. Zbl 1182.05064
Kierstead, H. A.; Kostochka, A. V.; Yu, Gexin
11
2009
On the pagenumber of \(k\)-trees. Zbl 1207.05101
Vandenbussche, Jennifer; West, Douglas B.; Yu, Gexin
3
2009
Ore-type conditions implying 2-factors consisting of short cycles. Zbl 1213.05213
Kostochka, Alexandr V.; Yu, Gexin
2
2009
Implications among linkage properties in graphs. Zbl 1182.05074
Liu, Qi; West, Douglas B.; Yu, Gexin
2
2009
\(M\)-degrees of quadrangle-free planar graphs. Zbl 1161.05024
Borodin, Oleg V.; Kostochka, Alexandr V.; Sheikh, Naeem N.; Yu, Gexin
2
2009
Ore-condition and \(Z_3\)-connectivity. Zbl 1171.05029
Luo, Rong; Xu, Rui; Yin, Jianhua; Yu, Gexin
33
2008
Decomposing a planar graph with girth 9 into a forest and a matching. Zbl 1144.05019
Borodin, Oleg V.; Kostochka, Alexandr V.; Sheikh, Naeem N.; Yu, Gexin
15
2008
On the first-fit chromatic number of graphs. Zbl 1180.05042
Balogh, József; Hartke, Stephen G.; Liu, Qi; Yu, Gexin
7
2008
Minimum degree conditions for \(H\)-linked graphs. Zbl 1144.05039
Kostochka, Alexandr; Yu, Gexin
6
2008
On a graph packing conjecture by Bollobás, Eldridge and Catlin. Zbl 1212.05132
Kaul, Hemanshu; Kostochka, Alexandr; Yu, Gexin
5
2008
Ore-type degree conditions for a graph to be \(H\)-linked. Zbl 1143.05049
Kostochka, Alexandr V.; Yu, Gexin
3
2008
Kinematic simulation for stably stratified and rotating turbulence. Zbl 1135.76028
Nicolleau, F.; Yu, G.; Vassilicos, J. C.
2
2008
Packing of graphs with small product of sizes. Zbl 1204.05078
Kostochka, Alexandr V.; Yu, Gexin
1
2008
Ore-type graph packing problems. Zbl 1122.05081
Kostochka, A. V.; Yu, G.
11
2007
An inequality for the group chromatic number of a graph. Zbl 1127.05041
Lai, Hong-Jian; Li, Xiangwen; Yu, Gexin
5
2007
An Ore-type analogue of the Sauer-Spencer theorem. Zbl 1125.05081
Kostochka, Alexandr; Yu, Gexin
4
2007
On extremal matrices of second largest exponent by Boolean rank. Zbl 1122.15002
Liu, Bolian; You, Lihua; Yu, Gexin
2
2007
On sufficient degree conditions for a graph to be \(k\)-linked. Zbl 1109.05061
Kawarabayashi, Ken-ichi; Kostochka, Alexandr; Yu, Gexin
27
2006
Nowhere-zero \(Z_3\)-flows through \(Z_3\)-connectivity. Zbl 1086.05043
DeVos, Matt; Xu, Rui; Yu, Gexin
26
2006
On minimum degree implying that a graph is \(H\)-linked. Zbl 1127.05059
Gould, Ronald J.; Kostochka, Alexandr; Yu, Gexin
9
2006
An extremal problem for \(H\)-linked graphs. Zbl 1078.05042
Kostochka, Alexandr; Yu, Gexin
13
2005
Two-particle diffusion and locality assumption. Zbl 1186.76395
Nicolleau, F.; Yu, G.
7
2004
Direct computational simulations for internal condensing flows and results on attainability/stability of steady solutions, their intrinsic waviness, and their noise sensitivity. Zbl 1111.74574
Narain, A.; Liang, Q.; Yu, G.; Wang, X.
2
2004
A dynamical model for turbulence. IX: Reynolds stresses for shear-driven flows. Zbl 1147.76351
Canuto, V. M.; Dubovikov, M. S.; Yu, G.
1
1999
A dynamical model for turbulence. VIII: IR and UV Reynolds stress spectra for shear-driven flows. Zbl 1147.76350
Canuto, V. M.; Dubovikov, M. S.; Yu, G.
1
1999
Min-max optimization of several classical discrete optimization problems. Zbl 0908.90220
Yu, G.
12
1998
A finite element approach to global-local modeling in composite laminate analysis. Zbl 0900.73797
Yu, G.; Tzeng, Guang-Yau; Chaturvedi, S.; Adeli, H.; Zhang, Shao Qing
1
1995
all top 5

Cited by 481 Authors

29 Yu, Gexin
27 Li, Xiangwen
25 Lai, Hong-Jian
19 Kostochka, Aleksandr Vasil’evich
11 Wang, Yingqian
10 Liu, Runrun
9 Kierstead, Henry A.
9 Zhan, Mingquan
8 Havet, Frédéric
8 Luo, Rong
8 Yin, Jianhua
7 Bu, Yuehua
7 Xu, Jinghan
7 Xu, Rui
6 Ferrara, Michael J.
6 Li, Hao
5 Gould, Ronald J.
5 Kawarabayashi, Ken-ichi
5 Kim, Seog-Jin
5 Shao, Yehong
5 West, Douglas Brent
5 Zhang, Cunquan
5 Zhu, Xuding
4 Borodin, Oleg Veniaminovich
4 Chen, Min
4 Dong, Wei
4 Ivanova, Anna Olegovna
4 Kühn, Daniela
4 Li, Jiaao
4 Li, Liangchen
4 Osthus, Deryk
4 Raspaud, André
4 Rolek, Martin
4 Vassilicos, John-Christos
4 Xu, Baogang
4 Yang, Fan
4 Zhang, Xiaoxia
4 Zhang, Xin
4 Zhou, Xiangqian
3 Chen, Lily
3 Chen, Ming
3 Chen, Ye
3 Cranston, Daniel W.
3 Dantas, Rennan
3 Huang, Mingfang
3 Huang, Ziwen
3 Kang, Ross J.
3 Kaul, Hemanshu
3 Li, Ping
3 Liu, Guizhen
3 Lu, Kai
3 Montassier, Mickaël
3 Mudrock, Jeffrey A.
3 Ozeki, Kenta
3 Pfender, Florian
3 Powell, Jeffrey Scott
3 Sampaio, Rudini Menezes
3 Strang, William Gilbert
3 Whalen, Thor C.
3 Wollan, Paul
3 Wu, Jian-Liang
3 Wu, Yezhou
3 Yan, Jin
3 Yang, Weihua
3 Ye, Dong
3 Yin, Yuxue
3 Yue, Jun
3 Zhang, Taoye
3 Zhou, Ju
2 Böhme, Thomas
2 Cai, Junqing
2 Cames van Batenburg, Wouter
2 Chang, Gerard Jennhwa
2 Chen, Yuan
2 Choi, Ilkyoo
2 Cohen, Nathann
2 Csaba, Béla
2 Dai, Xiangyu
2 Deng, Kecai
2 Fan, Genghua
2 Fan, Suohai
2 Guan, Jing-Xin
2 Guo, Xiaofeng
2 Han, Miaomiao
2 Hu, Jie
2 Jacobson, Michael Scott
2 Jahanbekam, Sogol
2 Li, Rui
2 Lidický, Bernard
2 Lin, Wensong
2 Linhares-Sales, Claudia
2 Liu, Jianping
2 Lv, Jianbo
2 Ma, Hongping
2 Ma, Jianqing
2 Ma, Xiaoling
2 Magnant, Colton
2 Miao, Zhengke
2 Mohar, Bojan
2 Molla, Theodore
...and 381 more Authors
all top 5

Cited in 48 Serials

78 Discrete Mathematics
30 Graphs and Combinatorics
25 Discrete Applied Mathematics
19 Journal of Combinatorial Theory. Series B
16 European Journal of Combinatorics
11 Journal of Combinatorial Optimization
9 Information Processing Letters
9 Discrete Mathematics, Algorithms and Applications
7 SIAM Journal on Discrete Mathematics
7 Physics of Fluids
7 Combinatorics, Probability and Computing
6 Applied Mathematics and Computation
5 Journal of Graph Theory
5 The Electronic Journal of Combinatorics
5 Discussiones Mathematicae. Graph Theory
5 Acta Mathematica Sinica. English Series
3 Theoretical Computer Science
3 Bulletin of the Malaysian Mathematical Sciences Society. Second Series
2 International Journal of Heat and Mass Transfer
2 Journal of Fluid Mechanics
2 Journal of Optimization Theory and Applications
2 Proceedings of the American Mathematical Society
2 Combinatorica
2 Computers & Operations Research
2 European Journal of Operational Research
2 Linear Algebra and its Applications
1 Houston Journal of Mathematics
1 Theoretical and Computational Fluid Dynamics
1 Czechoslovak Mathematical Journal
1 Information Sciences
1 Siberian Mathematical Journal
1 Studies in Applied Mathematics
1 Advances in Applied Mathematics
1 Operations Research Letters
1 International Journal of Production Research
1 Bulletin of the Iranian Mathematical Society
1 Algorithmica
1 Journal of Global Optimization
1 Mathematical Programming. Series A. Series B
1 Journal of Algebraic Combinatorics
1 Discrete Mathematics and Theoretical Computer Science. DMTCS
1 Flow, Turbulence and Combustion
1 Engineering Computations
1 Frontiers of Mathematics in China
1 Advances in Mathematics of Communications
1 Arabian Journal for Science and Engineering
1 Journal of the Operations Research Society of China
1 Computer Science Review

Citations by Year