The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andrew Thomason: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Béla Bollobás, Bruce A. Reed, Andrew Thomason
    An extremal function for the achromatic number. [Citation Graph (0, 0)][DBLP]
    Graph Structure Theory, 1991, pp:161-166 [Conf]
  2. Béla Bollobás, Andrew Thomason
    The Structure of Hereditary Properties and Colourings of Random Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2000, v:20, n:2, pp:173-202 [Journal]
  3. Béla Bollobás, Andrew Thomason
    Threshold functions. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1987, v:7, n:1, pp:35-38 [Journal]
  4. Béla Bollobás, Andrew Thomason
    Highly Linked Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1996, v:16, n:3, pp:313-320 [Journal]
  5. Roland Häggkvist, Andrew Thomason
    Trees in tournaments. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1991, v:11, n:2, pp:123-130 [Journal]
  6. Chris Jagger, Pavel Stovícek, Andrew Thomason
    Multiplicities of Subgraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1996, v:16, n:1, pp:123-141 [Journal]
  7. Joseph Samuel Myers, Andrew Thomason
    The Extremal Function For Noncomplete Minors. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2005, v:25, n:6, pp:725-753 [Journal]
  8. Andrew Thomason
    Graph Products and Monochromatic Multiplicities. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1997, v:17, n:1, pp:125-134 [Journal]
  9. Béla Bollobás, Andrew Thomason
    Frank Ramsey. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2003, v:12, n:5-6, pp:469-475 [Journal]
  10. Richard H. Schelp, Andrew Thomason
    A Remark on the Number of Complete and Empty Subgraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:2, pp:217-219 [Journal]
  11. Andrew Thomason
    Two Minor Problems. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2004, v:13, n:3, pp:412- [Journal]
  12. Béla Bollobás, Andrew Thomason
    Set colourings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:948-952 [Journal]
  13. Oleg Pikhurko, Andrew Thomason
    Disjoint subgraphs of large maximum degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:248, n:1-3, pp:125-141 [Journal]
  14. Béla Bollobás, Andrew Thomason
    Proof of a Conjecture of Mader, Erdös and Hajnal on Topological Complete Subgraphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1998, v:19, n:8, pp:883-887 [Journal]
  15. Béla Bollobás, Andrew Thomason
    Weakly Pancyclic Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1999, v:77, n:1, pp:121-137 [Journal]
  16. William H. Cunningham, Penny E. Haxell, R. Bruce Richter, Nicholas C. Wormald, Andrew Thomason
    To Adrian Bondy and U. S. R. Murty. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:90, n:1, pp:1- [Journal]
  17. Andrew Thomason
    The Extremal Function for Complete Minors. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:81, n:2, pp:318-338 [Journal]
  18. Martin E. Dyer, Trevor I. Fenner, Alan M. Frieze, Andrew Thomason
    On Key Storage in Secure Networks. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1995, v:8, n:4, pp:189-200 [Journal]
  19. Felix Lazebnik, Andrew Thomason
    Orthomorphisms and the construction of projective planes. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 2004, v:73, n:247, pp:1547-1557 [Journal]
  20. Béla Bollobás, Andrew Thomason
    Generalized Chromatic Numbers of Random Graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:6, n:2/3, pp:353-356 [Journal]
  21. Andrew Thomason
    Complete minors in pseudorandom graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:17, n:1, pp:26-28 [Journal]
  22. Andrew Thomason, Peter Wagner
    Complete graphs with no rainbow path. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2007, v:54, n:3, pp:261-266 [Journal]
  23. Louigi Addario-Berry, Ketan Dalal, Colin McDiarmid, Bruce A. Reed, Andrew Thomason
    Vertex-Colouring Edge-Weightings. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2007, v:27, n:1, pp:1-12 [Journal]
  24. Andrew Thomason
    Critically partitionable graphs II. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:41, n:1, pp:67-77 [Journal]
  25. Andrew Thomason
    Dense expanders and pseudo-random bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:75, n:1-3, pp:381-386 [Journal]
  26. Julie Haviland, Andrew Thomason
    Pseudo-random hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:75, n:1-3, pp:255-278 [Journal]
  27. Andrew Thomason
    A simple linear expected time algorithm for finding a hamilton path. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:75, n:1-3, pp:373-379 [Journal]
  28. Julie Haviland, Andrew Thomason
    On testing the 'pseudo-randomness' of a hypergraph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:103, n:3, pp:321-327 [Journal]

  29. Dismantling Sparse Random Graphs. [Citation Graph (, )][DBLP]


  30. Disjoint unions of complete minors. [Citation Graph (, )][DBLP]


  31. Bounding the size of square-free subgraphs of the hypercube. [Citation Graph (, )][DBLP]


  32. Hadwiger numbers and over-dominating colourings. [Citation Graph (, )][DBLP]


  33. Disjoint complete minors and bipartite minors. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002