research

Submitted:

•  Ore-condition and Z_3-connectivity, (with Rong Luo, Rui Xu and Jianhua Yin), submitted.

• Packing of graphs with small product of sizes, (with A. Kostochka), submitted.  Talk Slides

•  On Ore-type degree condition for a graph to be H-linked   (with A. Kostochka) submitted.

•  Implications among linkage properties in graphs, (with Q. Liu and D. West), submitted.

•  M-degrees and C4-free planar graphs, (with O. Borodin, A Kostochka, and N. Sheikh), submitted. Talk  Slides

 
In Press or Accepted:

• First-Fit chromatic numbers of planar and random graphs, (with J. Balogh, S. Hartke, and Q. Liu), to appear in SIAM J on Disc. Math.

• An inequality for the group chromatic number of a graph, (with Hong-Jian Lai and Xiangwen Li), to  appear in Discrete  Mathematics.

• Ore-conditions implying 2-factors consisting of short cycles , (with A. Kostochka), to appear in Discrete Mathematics.

•  Minimum degree conditions for $H$-linked graphs. (with A. Kostochka) to appear in Disc. Appl. Math.

•  On a graph packing conjecture of Bollobas, Eldridge and Catlin  (with H. Kaul, A. Kostochka) to appear in Combinatorica. Talk slides

•  Planar graphs with girth 9 can be edge-partitioned into a forest and a matching, (with O. Borodin, A Kostochka, and N. Sheikh), to appear in European J. of Combinatorics.

 
2007

•  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

•  A lower bound for minimum degreee 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 Z3-flows through Z3-connectivity . (with M. DeVos, R. Xu) Discrete Mathematics, 306 (2006), 26-30.

•  Extremal problems on packing of graphs, (extended abstract). (with A. Kostochka) Oberwolfach Report, 1(2006), 63-64.

2005 and before:

•  An extremal problem for H-linked graphs. (with A. Kostochka) J. Graph Theory, 50 (2005), 321-339.

•  On H-linked graphs (extended abstract). (with A. Kostochka) Oberwolfach Report, 1(2004), 42-44.

•  On maximal (k,b)-free sets of integers and its spectrum. Autr. J. Combin 23 (2001), 211--215. (with B. Liu and L. You)

• 6th Shanghai Conference on Combinatorics, Shanghai Jiaotong University, May 24-28, 2008
  • Extremal problems on graph packing

•   Graph Theory and Combinatorics Seminar, Vanderbilt University. 2007-1-24
  
  • Implications among linkage properties in graphs

• Extremal Combinatorics at Illinois (EXCILL), University of Illinois ar Urbana-Champaign, Nov18-20, 2006

• MIGHTY XLIII, Indiana-Purdue University at Fort Wayne, Nov 3-4, 2006

• First-Fit chromatic number for various classes of graphs.

• Research Seminar at MTSU, 2006-10-12

• First-Fit chromatic number of planar and random graphs.

• Graph Theory and Combinatorics Seminar, Vanderbilt University. 2006-10-2
  
  • First-Fit chromatic number of planar and random graphs.

• Combinatorics Seminar at UIUC, 2006-03-28
  • Title: An Ore-type analogue of the Sauer-Spencer Theorem

• MIGHTY XLII, Ohio State University Marion Campus, April 28-28, 2006
  • Title: Some new results on packing of sparse graphs

• Graph Theory Seminar at Georgia Institute of Technology, 2005-11-03
  • Title: On a graph packing conjecture

• MCCCC 19 , Rochester Institute of Technology, Oct 7-9, 2005
  • Talk slides are available:On the Bollobas-Eldridge-Catlin conjecture on graph packin

• MIGHTY XL1, Middle Tennessee State University, Sept 23-24, 2005
  
  • Title: On a Poset Problem of H-linked Graphs

• Graph Theory with Altitude on the Occasion of Joan Hutchinson's 60th Birthday, May 17-20th, 2005
  
  • Talk slides are available: On Ore-type degree sum condition forcing a graph to be H-linked.

• Combinatorics Seminar at UIUC, 2005-03-01
  • Title: On minimum degree implying a graph is H-linked

• MIGHTY XXXIX, Ball State University, Nov 19-20, 2004
  • Title: On H-linked graphs

• Discrete Math Seminar at ASU, 2004-03-23
  • Title: On H-linked graphs

• Combinatorics Seminar at UIUC, 2004-02-21
  • Title: On H-linked graphs

•  
• Combinatorics Seminar at UIUC, Nov 11, 2003-11-30
  • Title: Sufficient degree conditions for a graph to be k-linked

• MIGHTY XXXVII, Valparaiso University, Sept 19-20, 2003
  • Title: An extension of Dirac-type bound for k-ordered graphs

• IMA summer program, July 21-Aug 1, 2003.
  • Lecturers: Graham Brightwell, Andr�s Gyarf�s, Prasad Tetali, Robin Thomas, William T. Trotter

• Combinatorics Seminar at UIUC, Dec 10, 2002
  • Title: Graph homomorphism into an odd cycle

• 15th Cumberland Conference, University of Mississippi, May 16-18, 2002
  • Title: Graphic homomorphism into an odd cycle

• MIGHTY XXXIV, University of Oakland, Oct 13, 2001
  • Title: A note on group coloring