Gexin Yu

Research Interests:

Graph Theory.

Research Papers:

Submitted

• Equitable coloring sparse planar graphs (with Rong Luo and Chris Stephen)
• Graphs containing every 2-factor.pdf (with A. Kostochka)
• Injective colorings of graphs with low average degree (with Dan Cranston and Seog-Jin Kim)
• Injective colorings of sparse graphs (with Dan Cranston and Seog-Jin Kim)

2009

• A new bound on the density of vertex identifying codes for the infintie hexagonal grid (with Dan Cranston) Accepted by Electronic Journal of Combinatorics
• Extremal graph packing problems: Ore-type versus Dirac-type (with H. Kierstead and A. Kostochka), to appear in London Mathematical Society Lecture Note Series, published by Cambridge University Press.
• Ore-conditions implying 2-factors consisting of short cycles (with A. Kostochka), Discrete Mathematics 309 (2009) 4762-4771.
• On the pagenumebr of k-trees (with J. Vandenbussche, D.B. West), to appear in SIAM J. on Discrete Mathematics
• M-degrees and $C_4$-free planar graphs (with O. Borodin, A Kostochka, and N. Sheikh), J. Graph Theory 60 (2009), no. 1, 80--85.
• Implications among linkage properties in graphs (with Q. Liu and D. West), J. Graph Theory 60 (2009), no. 4, 327--337.
• Hamiltonian connectedness in 3-connected line graphs. (with H.-J. Lai, Y. Shao and M. Zhan), Discrete Appl. Math. 157 (2009), no. 5, 982--990.
• On the minimum 2-wide widameter of Cylces with Chords (with B. Liu and X. Hou) Operation Research Transactions (Chinese) 13 (2009) 1-5.

2008

• Packing of graphs with small product of sizes (with A. Kostochka), J. Combin. Theory Ser. B 98 (2008), no. 6, 1411--1415.
• On a graph packing conjecture of Bollob\'as, Eldridge and Catlin (with H. Kaul, A. Kostochka), Combinatorica 28 (2008), no. 4, 469--485.
• Ore-condition and $Z_3$-connectivity (with Rong Luo, Rui Xu and Jianhua Yin), European J. of Combinatorics 29 (2008) 1587-1595.
• On Ore-type degree condition for a graph to be $H$-linked (with A. Kostochka), J. Graph Theory, 58 (2008) 14-26.
• First-Fit chromatic numbers of planar and random graphs (with J. Balogh, S. Hartke, and Q. Liu), SIAM J. on Discrete Mathematics 22 (2008), 887-900.
• Minimum degree conditions for $H$-linked graphs (with A. Kostochka), Disc. Appl. Math 156 (2008) 1542-1548.
• Planar graphs with girth $9$ can be edge-partitioned into a forest and a matching (with O. Borodin, A Kostochka, and N. Sheikh), European J. of Combinatorics, 29 (2008) 1235-1248.

2007

• An inequality for the group chromatic number of a graph (with Hong-Jian Lai and Xiangwen Li), Discrete Mathematics, 307 (2007) 3076-3080.
• An Ore-type analogue of the Sauer-Spencer Theorem (with A. Kostochka), Graphs and Combinatorics 23 (2007) no 4, 419-424.
• On extremal matrices of second large exponent by boolean rank (with B. Liu and L. You), Linear Algebra and Application 422 (2007) 186-197.
• Ore-type graph packing problems (with A. Kostochka), Combinatorics, Probability and Computing 16 (2007), 167-169.

2006 and before

• A lower bound for minimum degree in $H$-linked graphs (with R. Gould, A. Kostochka), SIAM J. on Discrete Math (SIDMA) 20 (2006), 829-840.
• On Degree Conditions for a Graph to be $k$-linked (with K. Kawarabayashi, A. Kostochka), Combinatorics, Probability and Computing 15 (2006), 685--694.
• Nowhere-zero $Z_3$-flows through $Z_3$-connectivity (with M. DeVos, R. Xu), Discrete Mathematics 306 (2006), 26-30.
• An extremal problem for $H$-linked graphs (with A. Kostochka), J. Graph Theory 50 (2005), 321-339.
• On maximal $(k,b)$-free sets of integers and its spectrum (with B. Liu and L. You), Austra.. J. Combin. 23 (2001), 211--215.