List of Publications


Papers that have been published:


  1. Partitioning graphs of bounded tree-width, (Joint with D. Sanders, B. Oporowski, and D. Vertigan), Combinatorica. 18 (1) (1998), 1 - 12.
  2. Chordal graphs, interval graphs, and wqo, Journal of Graph Theory. 28 (2) (1998), 105 - 114.
  3. Unavoidable minors of large 3-connected matroids, (Joint with B. Oporowski, J. Oxley, and D. Vertigan), Journal of Combinatorial Theory, Series B, 71 (2) (1997), 244--293.
  4. Matroids arisen from matrogenic graphs, (Joint with P. Hammer), Discrete Mathematics 165/166 (1997) 211-217.
  5. Bounding the number of circuits of a graph, Combinatorica, 16 (3) (1996), Page 331--341.
  6. Unavoidable minors of large 3-connected binary matroids, (Joint with B. Oporowski, J. Oxley and D. Vertigan), Journal of Combinatorial Theory, Series B, 66 (2) (1996), 334 - 360.
  7. On tree partitions of graphs, (Joint with B. Oporowski), Discrete Mathematics, 149 (1996), 45 - 58.
  8. Excluding a long double path minor, Journal of Combinatorial Theory, Series B, 66 (1) (1996), 11 - 23.
  9. Some results on tree decomposition of graphs, (Joint with B. Oporowski), Journal of Graph Theory, 20 (4) (1995), 481 - 499.
  10. Bounding the number of bases of a matroid, Combinatorica, 15 (2) (1995), 159 -169.
  11. Graphs with not too many spanning trees, Networks, 25 (1995), 193 -197.
  12. On infinite antichains of matroids, (Joint with B. Oporowski and J. Oxley), Journal of Combinatorial Theory, Series B, 63 (1) (1995), 21 - 40.
  13. Recognizing the $P_4$-structure of a tree, Graphs and Combinatorics, 10 (1994), 323 - 328.
  14. Bounding the vertex cover number of a hypergraph, (Joint with P. Seymour and P. Winkler), Combinatorica, 14 (1) (1994), 23 - 34.
  15. Monotone clutters, Discrete Mathematics, 119 (1993), 67 - 77.
  16. Stable sets versus independent sets, Discrete Mathematics, 117 (1993), 73 - 88.
  17. Clutters with $\tau_2=2\tau$, Discrete Mathematics, 115 (1993), 141 -152.
  18. The immersion relation on webs (Extended abstract), Contemporary Mathematics, 147 (1993), Graph Structure Theory, American Mathematical Society, Volume Editors: Neil Robertson and Paul Seymour, Page 517 - 524.
  19. Disjoint cycles in directed graphs on the torus and the Klein bottle, (Joint with A. Schrijver and P. Seymour), Journal of Combinatorial Theory, Series B, 58 (1) (1993), 40 - 45.
  20. Disjoint circuits on a Klein bottle and a theorem on posets, Discrete Math., 112 (1993), 81 - 91.
  21. Subgraphs and well-quasi-ordering, Journal of Graph Theory, 16 (5) (1992), 489 - 502.
  22. Disjoint paths in a planar graph - a general theorem, (Joint with A. Schrijver and P. Seymour), SIAM Journal of Discrete Mathematics, 5 (1) (1992), 112 -116.
  23. Covering the edges with consecutive sets, Journal of Graph Theory, 15 (5) (1991), 559 - 562.
  24. On the maximum 2--1 matching, ACTA mathematicae applicatae Sinica, 3 (4) (1987), 305 - 312.
Papers that have been accepted for publication:


  1. On canonical antichains, Order.


Papers that have been submitted for publication:


  1. Packing cycles in graphs, II


  2. Unavoidable double-connected large graphs


  3. Generating r-regular graphs


Go back to the Previous Page...