Books and Volumes Edited

     

  1. A Course on the Web Graph, AMS Graduate Studies in Mathematics Series, and AARMS Monograph Series.
  2. The 5th Workshop On Algorithms And Models For The Web-Graph (WAW2007), co-edited with Fan Chung Graham.

     

    Papers

     

    2008

    2007

    2006

    2005

    2004

    2003

    2002

    2001

    2000

    1999

    1998

    Submitted

    Thesis

    Co-authors

    2008

  3. The n-ordered graphs - a new graph class, with Jeannette Janssen and Changping Wang; pdf accepted to Journal of Graph Theory.
  4. A spatial web graph model with local influence regions, with William Aiello, Colin Cooper, Jeannette Janssen, P. Pralat, pdf, accepted to Internet Mathematics.
  5. Infinite limits and adjacency properties of a generalized copying model, with Jeannette Janssen, pdf accepted to Internet Mathematics.
  6. Universal random semi-directed graphs, with D. Delic and Changping Wang; pdf, Proceedings of ROGICS'08.
  7. The search-time of a graph, with Gena Hahn, Peter Golovach, and Jan Kratochvil; pdf accepted to Discrete Mathematics.
  8. All countable monoids embed into the monoid of the infinite random graph, with D. Delic and Igor Dolinka; pdf accepted to Discrete Applied Mathematics.
  9. The good, the bad, and the great: homomorphisms and cores of random graphs, with P. Pralat; pdf accepted to Discrete Mathematics.
  10. A note on domination parameters in random graphs, with Changping Wang; pdf, Discussiones Mathematicae Graph Theory 28 (2008) 335-343.
  11. Graphs with the n-e.c. adjacency property constructed from affine planes, with Cathy Baker, Julia Brown, and Tamas Szonyi; pdf, Discrete Mathematics 208 (2008) 901-912.

    2007

  12. Random graph models for the web graph; pdf, invited paper In: Proceedings of 4th National Conference on Mathematical and Computational Models (NCMCM07).
  13. A spatial web graph model with local influence regions, with William Aiello, Colin Cooper, Jeannette Janssen, P. Pralat, pdf, Proceedings of WAW07.
  14. Vertex pursuit games in stochastic network models, with Pawel Pralat and Changping Wang; pdf Proceedings of CAAN07.
  15. The cop density of a graph, with Gena Hahn and Changping Wang; pdf Contributions to Discrete Mathematics 2 (2007) 133-144.
  16. A note on uniquely H-colorable graphs; pdf, Discussiones Mathematicae Graph Theory 27 (2007) 39-44.

    2006

  17. Mutually embeddable graphs and the Tree Alternative conjecture, with Claude Tardif, pdf, Journal of Combinatorial Theory, Series B 96 (2006) 874-880.
  18. Spanning subgraphs of graphs partitioned into two isomorphic pieces; pdf, the Journal of Graph Theory 51 (2006) 123-136.
  19. On an adjacency property of almost all tournaments, with K. Cameron; pdf; Discrete Mathematics 306 (2006) 2327-2335.
  20. Matchings defined by local conditions, with Alexandru Costea; pdf, Journal of Combinatorial Mathematics and Combinatorial Computing 58 (2006) 41-53.

    2005

  21. Infinite limits of the duplication model and graph folding, with Jeannette Janssen; extended abstract accepted to Discrete Mathematics and Theoretical Computer Science for the EUROCOMB05 conference.

    2004

  22. A survey of models of the web graph, invited paper pdf, Proceedings of Combinatorial and Algorithmic Aspects of Networking, 2004.
  23. Infinite limits of copying models of the web graph, with J. Janssen, Internet Mathematics 1 (2004) 193-213. pdf.
  24. A note on orientations of the infinite random graph, with D. Delic; pdf, European Journal of Combinatorics 25 (2004) 921-926.
  25. Limits and power laws of models for the web graph and other networked information spaces, with J. Janssen; pdf, Proceedings of Combinatorial and Algorithmic Aspects of Networking, 2004.
  26. On a problem of Cameron's on inexhaustible graphs, with D. Delic, pdf, Combinatorica 24 (2004) 35-51.

    2003

  27. Large families of mutually embeddable vertex-transitive graphs, pdf with Claude Tardif, the Journal of Graph Theory 43 (2003) 99-106. Pdf
  28. Homomorphisms and amalgamation, pdf, Discrete Mathematics 270 (2003) 32-41.
  29. Partitioning a graph into two isomorphic pieces, pdf with Richard Nowakowski, Journal of Graph Theory 44 (2003) 1-14.
  30. Graphs with the 3-e.c. adjacency property constructed from affine planes, pdf with C. Baker and J. Brown, the Journal of Combinatorial Mathematics and Combinatorial Computing, 46 (2003) 65-83.

    2002

  31. On retracts of the random graph and their natural order, Monatschefte fur Mathematik, 135 (2002) 1-9. Pdf
  32. A family of universal pseudo-homogeneous G-colourable graphs, Discrete Mathematics 247 (2002) 13-23. Pdf
  33. Skolem arrays and Skolem labellings of ladder graphs, with C. Baker and P. Kergin; Ars Combinatoria 63 (2002), 97-107. Pdf
  34. Generalized pigeonhole properties of graphs and oriented graphs, with P. Cameron, D. Delic, and S. Thomasse, European Journal of Combinatorics 23 (2002) 257-274. Pdf

    2001

  35. Hadamard matrices and strongly regular graphs with the 3-e.c. adjacency property, with Wolf Holzmann and Hadi Kharaghani, Electronic Journal of Combinatorics, Vol 8 (1), 2001. Pdf
  36. Metrically universal generic structures in free amalgamation classes, Mathematical Logic Quarterly 47 (2001) 147-160. Pdf
  37. On an adjacency property of almost all graphs, with K. Cameron, Discrete Mathematics 231 (2001) 103-119. Pdf
  38. Finitely constrained classes closed under unions and n-e.c. structures, Ars Combinatoria 59 (2001) 181-192. Pdf
  39. On 2-e.c. line-critical graphs, with K. Cameron; pdf, the Journal of Combinatorial Mathematics and Combinatorial Computing, 38 (2001) 111-121. Pdf

    2000

  40. The monoid of the random graph, with D. Delic, Semigroup Forum 61 (2000) 138-148. Pdf
  41. Tournaments and orders with the pigeonhole property, with P.J. Cameron and D. Delic, Canadian Mathematical Bulletin 43 (2000) 397-405. Pdf
  42. On 2-e.c. graphs, tournaments, and hypergraphs, with K. Cameron, 6th International Conference on Graph Theory (Marseille, 2000), 4 pp. (electronic), Electron. Notes Discrete Math., 5, Elsevier, Amsterdam, 2000. Pdf

    1999

  43. A pigeonhole property for relational structures with D. Delic, Mathematical Logic Quarterly 45 (1999) 3, 409-413.

    1998

  44. The model companion of width-two orders, with D. Delic, Order 14 (1998) 87-99. Pdf
  45. Continuum many universal Horn classes of graphs of bounded chromatic number, Algebra Universalis 40 (1998), 105-108. Pdf

    Submitted

  46. Graphs with the n-e.c. adjacency property constructed from resolvable designs, with Cathy Baker, Neil McKay, and Pawel Pralat; pdf, submitted to Journal of Combinatorial Designs.
  47. Signed b-edge covers of graphs, with Kathie Cameron and Changping Wang; pdf submitted to Graphs and Combinatorics.
  48. Network security in models of complex networks, with P. Pralat and Changping Wang; pdf submitted to Internet Mathematics.
  49. The search for n-e.c. graphs, pdf, submitted to Contributions to Discrete Mathematics

    Thesis

  50. My Ph.D thesis, written in 1998 at the University of Waterloo, was on Colourings, generics, and free amalgams.

  51. My Masters thesis, written in 1994 at the University of Waterloo, was on On Residually Small Varieties.

    Co-authors

    William Aiello, Cathy Baker, Julia Brown, Kathie Cameron, Peter Cameron, Colin Cooper, Alexandru Costea, Fan Chung Graham, Dejan Delic, Igor Dolinka, Peter Golovach, Gena Hahn, Wolf Holzmann, Patrick Kergin, Hadi Kharaghani, Jan Kratochvil, Jeannette Janssen, Richard Nowakowski, Pawel Pralat, Tamas Szonyi, Claude Tardif, Stephan Thomasse, Changping Wang.
    Back to my homepage.