| 2009 |
|---|
| 16 | EE | Oleg V. Borodin,
Alexandr V. Kostochka,
Naeem N. Sheikh,
Gexin Yu:
M-degrees of quadrangle-free planar graphs.
Journal of Graph Theory 60(1): 80-85 (2009) |
| 15 | EE | Qi Liu,
Douglas B. West,
Gexin Yu:
Implications among linkage properties in graphs.
Journal of Graph Theory 60(4): 327-337 (2009) |
| 2008 |
|---|
| 14 | EE | Hemanshu Kaul,
Alexandr V. Kostochka,
Gexin Yu:
On a graph packing conjecture by Bollobás, Eldridge and Catlin.
Combinatorica 28(4): 469-485 (2008) |
| 13 | EE | Alexandr V. Kostochka,
Gexin Yu:
Minimum degree conditions for H-linked graphs.
Discrete Applied Mathematics 156(9): 1542-1548 (2008) |
| 12 | EE | Oleg V. Borodin,
Alexandr V. Kostochka,
Naeem N. Sheikh,
Gexin Yu:
Decomposing a planar graph with girth 9 into a forest and a matching.
Eur. J. Comb. 29(5): 1235-1241 (2008) |
| 11 | EE | Rong Luo,
Rui Xu,
Jianhua Yin,
Gexin Yu:
Ore-condition and Z3-connectivity.
Eur. J. Comb. 29(7): 1587-1595 (2008) |
| 10 | EE | Alexandr V. Kostochka,
Gexin Yu:
Packing of graphs with small product of sizes.
J. Comb. Theory, Ser. B 98(6): 1411-1415 (2008) |
| 9 | EE | Alexandr V. Kostochka,
Gexin Yu:
Ore-type degree conditions for a graph to be H-linked.
Journal of Graph Theory 58(1): 14-26 (2008) |
| 8 | EE | József Balogh,
Stephen G. Hartke,
Qi Liu,
Gexin Yu:
On the First-Fit Chromatic Number of Graphs.
SIAM J. Discrete Math. 22(3): 887-900 (2008) |
| 2007 |
|---|
| 7 | EE | Alexandr V. Kostochka,
Gexin Yu:
Ore-type graph packing problems.
Combinatorics, Probability & Computing 16(1): 167-169 (2007) |
| 6 | EE | Hong-Jian Lai,
Xiangwen Li,
Gexin Yu:
An inequality for the group chromatic number of a graph.
Discrete Mathematics 307(23): 3076-3080 (2007) |
| 2006 |
|---|
| 5 | EE | Ken-ichi Kawarabayashi,
Alexandr V. Kostochka,
Gexin Yu:
On Sufficient Degree Conditions for a Graph to be k-linked.
Combinatorics, Probability & Computing 15(5): 685-694 (2006) |
| 4 | EE | Matt DeVos,
Rui Xu,
Gexin Yu:
Nowhere-zero Z3-flows through Z3-connectivity.
Discrete Mathematics 306(1): 26-30 (2006) |
| 3 | EE | Ronald J. Gould,
Alexandr V. Kostochka,
Gexin Yu:
On Minimum Degree Implying That a Graph is H-Linked.
SIAM J. Discrete Math. 20(4): 829-840 (2006) |
| 2005 |
|---|
| 2 | EE | Alexandr V. Kostochka,
Gexin Yu:
Minimum degree conditions for H-linked graphs.
Electronic Notes in Discrete Mathematics 21: 331 (2005) |
| 1 | EE | Alexandr V. Kostochka,
Gexin Yu:
An extremal problem for H-linked graphs.
Journal of Graph Theory 50(4): 321-339 (2005) |
