Papers:

  1. New Ore-type conditions for H-linked graphs , (with Michael Ferrara, Ron Gould, Michael Jacobson, Jeffrey Powell, Thor Whalen), Journal of Graph Theory (2011), DOI 10.1002/jgt.20632.
  2. Total edge irregularity strength of large graphs , Discrete Mathematics (2011), DOI 10.1016/j.disc.2011.08.027 .
  3. A new upper bound for the irregularity strength of graphs, (with Maciej Kalkowski and Michal Karonski), SIAM Journal on Discrete Mathematics. 25 (2011) 1319-1321.
  4. An iterative approach to the irregularity strength of trees , (with Michael Ferrara, Ron Gould and Michal Karonski), Discrete Applied Math 158 (2010), 1189-1194.
  5. Rooted induced trees in triangle-free graphs. Journal of Graph Theory 64 (2010), 206-209.
  6. Vertex-coloring edge-weightings: Towards the 1-2-3 conjecture, (with Maciej Kalkowski and Michal Karonski), Journal of Combinatorial Theory Ser. B 100 (2010), 347-349.
  7. Vertex-coloring edge-weightings with integer weights at most 6, (with Maciej Kalkowski and Michal Karonski), Rostocker Mathematisches Kolloquium. 64 (2009), 39-44.
  8. Critical graphs for subpancyclicity of 3-connected claw-free graphs , (with Ron Gould and Tomasz Luczak), Journal of Graph Theory 62 (2009), 263-278.
  9. A Note on Cycle Spectra of Line Graphs , Discrete Mathematics, 309 (2009), 2922-2924.
  10. Visibility Graphs of Point Sets in the Plane , Discrete & Computational Geometry 39 (2008) Issue 1-3, 455-459.
  11. Improved Delsarte bounds for spherical codes in small dimensions , J. Combin. Theory Ser. A 114 (2007) Issue 6, 1133-1147.
  12. Hamiltonicity and forbidden subgraphs in 4-connected graphs , Journal of Graph Theory 49 (2005) Issue 4, 262-272.
  13. Graph Minors and Linkages , Journal of Graph Theory 49 (2005) Issue 1, 75-91, (with Guantao Chen, Ron Gould, Ken-ichi Kawarabayashi and Bing Wei).
  14. Kissing numbers, sphere packings, and some unexpected proofs , AMS Notices 51 (2004) No. 8 (September) , (with Günter Ziegler).
  15. Linear Forests and Ordered Cycles , Discussiones Mathematicae Graph Theory 24 (2004) No.3, 359-372, (with Guantao Chen, Ralph Faudree, Ron Gould, Michael Jacobson and Linda Lesniak).
  16. Pancyclicity in 3-connected graphs: pairs of forbidden subgraphs , Journal of Graph Theory 47 (2004) Issue 3, 183-202, (with Ron Gould and Tomasz Luczak).
  17. Claw-free 3-connected P11-free Graphs are Hamiltonian , Journal of Graph Theory 47 (2004) Issue 2, 111-121, (with Tomasz Luczak).
  18. 2-Factors in Hamiltonian Graphs , Ars Combinatoria 72 (2004), 287-293 .
  19. New Conditions for k-ordered Hamiltonian Graphs , Ars Combinatoria 70 (2004), 245-255 , (with Guantao Chen and Ron Gould).
  20. Extremal Graphs for Intersecting Cliques Journal of Combinatorial Theory Ser. B 89 (2003) Issue 2, 159-171 , (with Guantao Chen, Ron Gould and Bing Wei).
  21. On k-ordered Bipartite Graphs , Electronic Journal of Combinatorics 10 (2003), no. 1, Research Paper 11, 12 pp. (electronic) (with Jill Faudree, Ron Gould and Allison Wolf).
  22. On graph irregularity strength , Journal of Graph Theory 41 (2002) Vol.2, 120-137 (with Alan M.Frieze, Ron Gould and Michal Karonski).
  23. Pancyclicity in Claw-free Graphs , Discrete Math. 256 (2002) Vol.1-2, 151-160 (with Ron Gould).
  24. A Result About Dense k-linked Graphs , Congr. Numer. 140 (1999) 209-211.
  25. To Appear:

  26. Cycle Spectra of Hamiltonian Graphs (with Kevin G. Milans, Dieter Rautenbach, Friedrich Regen and Douglas B. West), to appear in Journal of Combinatorial Theory Ser. B.
  27. Complete subgraphs in multipartite graphs, to appear in Combinatorica.
  28. Submitted:

  29. Extremal Graphs Having No Stable Cutsets , (with Van Bang Le).
  30. Rainbow Matchings of Size delta(G) in Properly Edge-Colored Graphs , (with Jennifer Diemunsch, Michael Ferrara, Casey Moffatt and Paul S. Wenger).
  31. Degree conditions for H-linked digraphs , (with Michael Ferrara and Michael Jacobson).
  32. Combined degree and connectivity conditions for H-linked graphs .
  33. In Preparation:

  34. Monochromatic triangles in three-colored graphs (with Daniel Kral, Konrad Sperfeld and Andrew Treglown).
  35. Complexity for rainbow matchings (with Van Bang Le).
  36. On regular simplicial complexes (with Gordon Royle).
  37. Large rainbow matchings in large graphs (with Alexandr Kostochka and Matthew Yancey).
  38. Saturation in multipartite graphs (with Michael Ferrara, Michael Jacobson and Paul Wenger).


    Remark: There might be some discrepancies between the postscript or pdf file of an article one may load from this page and its final version printed in the journal (which, typically, owns the copyright). Thus, the files posted here should be treated as useful but informal descriptions of the published results.