dblp.uni-trier.dewww.uni-trier.de

Gexin Yu

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
16EEOleg 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)
15EEQi Liu, Douglas B. West, Gexin Yu: Implications among linkage properties in graphs. Journal of Graph Theory 60(4): 327-337 (2009)
2008
14EEHemanshu Kaul, Alexandr V. Kostochka, Gexin Yu: On a graph packing conjecture by Bollobás, Eldridge and Catlin. Combinatorica 28(4): 469-485 (2008)
13EEAlexandr V. Kostochka, Gexin Yu: Minimum degree conditions for H-linked graphs. Discrete Applied Mathematics 156(9): 1542-1548 (2008)
12EEOleg 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)
11EERong Luo, Rui Xu, Jianhua Yin, Gexin Yu: Ore-condition and Z3-connectivity. Eur. J. Comb. 29(7): 1587-1595 (2008)
10EEAlexandr V. Kostochka, Gexin Yu: Packing of graphs with small product of sizes. J. Comb. Theory, Ser. B 98(6): 1411-1415 (2008)
9EEAlexandr V. Kostochka, Gexin Yu: Ore-type degree conditions for a graph to be H-linked. Journal of Graph Theory 58(1): 14-26 (2008)
8EEJó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
7EEAlexandr V. Kostochka, Gexin Yu: Ore-type graph packing problems. Combinatorics, Probability & Computing 16(1): 167-169 (2007)
6EEHong-Jian Lai, Xiangwen Li, Gexin Yu: An inequality for the group chromatic number of a graph. Discrete Mathematics 307(23): 3076-3080 (2007)
2006
5EEKen-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)
4EEMatt DeVos, Rui Xu, Gexin Yu: Nowhere-zero Z3-flows through Z3-connectivity. Discrete Mathematics 306(1): 26-30 (2006)
3EERonald 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
2EEAlexandr V. Kostochka, Gexin Yu: Minimum degree conditions for H-linked graphs. Electronic Notes in Discrete Mathematics 21: 331 (2005)
1EEAlexandr V. Kostochka, Gexin Yu: An extremal problem for H-linked graphs. Journal of Graph Theory 50(4): 321-339 (2005)

Coauthor Index

1József Balogh [8]
2Oleg V. Borodin [12] [16]
3Matt DeVos [4]
4Ronald J. Gould [3]
5Stephen G. Hartke [8]
6Hemanshu Kaul [14]
7Ken-ichi Kawarabayashi [5]
8Alexandr V. Kostochka [1] [2] [3] [5] [7] [9] [10] [12] [13] [14] [16]
9Hong-Jian Lai [6]
10Xiangwen Li [6]
11Qi Liu [8] [15]
12Rong Luo [11]
13Naeem N. Sheikh [12] [16]
14Douglas B. West [15]
15Rui Xu [4] [11]
16Jianhua Yin [11]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)