Set colourings of graphs. - Béla Bollobás; Andrew Thomason 001 (Discret. Math., 1979)

An Algorithm for the Most Economic Link Addition in a Tree Communication Network. - Ernest J. Cockayne; Frank Ruskey; Andrew G. Thomason (Inf. Process. Lett., 1979)

Critically partitionable graphs, I. - Andrew G. Thomason (J. Comb. Theory B, 1979)

Contributions to the theory of domination, independence and irredundance in graphs. - Ernest J. Cockayne; Odile Favaron; C. Payan; Andrew G. Thomason (Discret. Math., 1981)

Graphs which Contain all Small Graphs. - Béla Bollobás; Andrew Thomason 001 (Eur. J. Comb., 1981)

Dense neighbourhoods and Turán's theorem. - Béla Bollobás; Andrew Thomason 001 (J. Comb. Theory B, 1981)

Critically partitionable graphs II. - Andrew Thomason 001 (Discret. Math., 1982)

On Finite Ramsey Numbers. - Andrew Thomason 001 (Eur. J. Comb., 1982)

Ordered colourings of graphs. - Ernest J. Cockayne; Andrew G. Thomason (J. Comb. Theory B, 1982)

Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable. - Andrew Thomason 001 (J. Graph Theory, 1982)

Parallel sorting. - Béla Bollobás; Andrew Thomason 001 (Discret. Appl. Math., 1983)

Threshold functions. - Béla Bollobás; Andrew Thomason 001 (Comb., 1987)

A Graph Property not Satisfying a 'Zero-One Law'. - Andrew Thomason 001 (Eur. J. Comb., 1988)

An upper bound for some ramsey numbers. - Andrew Thomason 001 (J. Graph Theory, 1988)

Pseudo-random hypergraphs. - Julie Haviland; Andrew Thomason 001 (Discret. Math., 1989)

A simple linear expected time algorithm for finding a hamilton path. - Andrew Thomason 001 (Discret. Math., 1989)

Dense expanders and pseudo-random bipartite graphs. - Andrew Thomason 001 (Discret. Math., 1989)

An extremal function for the achromatic number. - Béla Bollobás; Bruce A. Reed; Andrew Thomason 001 (Graph Structure Theory, 1991)

Trees in tournaments. - Roland Häggkvist; Andrew Thomason 001 (Comb., 1991)

Rotation numbers for complete tripartite graphs. - Julie Haviland; Andrew Thomason 001 (Graphs Comb., 1991)

On testing the 'pseudo-randomness' of a hypergraph. - Julie Haviland; Andrew Thomason 001 (Discret. Math., 1992)

Rotation numers for complete bipartite graphs. - Julie Haviland; Andrew Thomason 001 (J. Graph Theory, 1992)

Oriented hamilton cycles in digraphs. - Roland Häggkvist; Andrew Thomason 001 (J. Graph Theory, 1995)

On Key Storage in Secure Networks. - Martin E. Dyer; Trevor I. Fenner; Alan M. Frieze; Andrew Thomason 001 (J. Cryptol., 1995)

Generalized Chromatic Numbers of Random Graphs. - Béla Bollobás; Andrew Thomason 001 (Random Struct. Algorithms, 1995)

Highly Linked Graphs. - Béla Bollobás; Andrew Thomason 001 (Comb., 1996)

Multiplicities of Subgraphs. - Chris Jagger; Pavel Stovícek; Andrew Thomason 001 (Comb., 1996)

Graph Products and Monochromatic Multiplicities. - Andrew Thomason 001 (Comb., 1997)

On the girth of hamiltonian weakly pancyclic graphs. - Béla Bollobás; Andrew Thomason 001 (J. Graph Theory, 1997)

A Remark on the Number of Complete and Empty Subgraphs. - Richard H. Schelp; Andrew Thomason 001 (Comb. Probab. Comput., 1998)

Proof of a Conjecture of Mader, Erdös and Hajnal on Topological Complete Subgraphs. - Béla Bollobás; Andrew Thomason 001 (Eur. J. Comb., 1998)

Weakly Pancyclic Graphs. - Béla Bollobás; Andrew Thomason 001 (J. Comb. Theory B, 1999)

The Structure of Hereditary Properties and Colourings of Random Graphs. - Béla Bollobás; Andrew Thomason 001 (Comb., 2000)

Subdivisions, linking, minors, and extremal functions. - Andrew Thomason 001 (Electron. Notes Discret. Math., 2000)

On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphs. - Richard H. Schelp; Andrew Thomason 001 (J. Graph Theory, 2000)

Complete minors in pseudorandom graphs. - Andrew Thomason 001 (Random Struct. Algorithms, 2000)

The Extremal Function for Complete Minors. - Andrew Thomason 001 (J. Comb. Theory B, 2001)

Disjoint subgraphs of large maximum degree. - Oleg Pikhurko; Andrew Thomason 001 (Discret. Math., 2002)

Frank Ramsey. - Béla Bollobás; Andrew Thomason 001 (Comb. Probab. Comput., 2003)

Two Minor Problems. - Andrew Thomason 001 (Comb. Probab. Comput., 2004)

To Adrian Bondy and U. S. R. Murty. - William H. Cunningham; Penny E. Haxell; R. Bruce Richter; Nicholas C. Wormald; Andrew Thomason 001 (J. Comb. Theory B, 2004)

Orthomorphisms and the construction of projective planes. - Felix Lazebnik; Andrew Thomason 001 (Math. Comput., 2004)

The Extremal Function For Noncomplete Minors. - Joseph Samuel Myers; Andrew Thomason 001 (Comb., 2005)

Vertex-Colouring Edge-Weightings. - Louigi Addario-Berry; Ketan Dalal; Colin McDiarmid; Bruce A. Reed; Andrew Thomason 001 (Comb., 2007)

Disjoint complete minors and bipartite minors. - Andrew Thomason 001 (Eur. J. Comb., 2007)

Complete graphs with no rainbow path. - Andrew Thomason 001; Peter Wagner 002 (J. Graph Theory, 2007)

Dismantling Sparse Random Graphs. - Svante Janson; Andrew Thomason 001 (Comb. Probab. Comput., 2008)

Disjoint unions of complete minors. - Andrew Thomason 001 (Discret. Math., 2008)

Maximum acyclic and fragmented sets in regular graphs. - Penny E. Haxell; Oleg Pikhurko; Andrew Thomason 001 (J. Graph Theory, 2008)

Bounding the size of square-free subgraphs of the hypercube. - Andrew Thomason 001; Peter Wagner 002 (Discret. Math., 2009)

Vicarious Graphs. - Tomasz Luczak 001; Andrew Thomason 001 (Comb. Probab. Comput., 2010)

Hadwiger numbers and over-dominating colourings. - Thomas Böhme 001; Alexandr V. Kostochka; Andrew Thomason 001 (Discret. Math., 2010)

Weighted spectral distribution for internet topology analysis: theory and applications. - Damien Fay; Hamed Haddadi; Andrew Thomason 001; Andrew W. Moore 002; Richard Mortier; Almerima Jamakovic; Steve Uhlig; Miguel Rio (IEEE/ACM Trans. Netw., 2010)

The structure of hereditary properties and 2-coloured multigraphs. - Edward Marchant; Andrew Thomason 001 (Comb., 2011)

Minors in Graphs with High Chromatic Number. - Thomas Böhme 001; Alexandr V. Kostochka; Andrew Thomason 001 (Comb. Probab. Comput., 2011)

Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree. - Klas Markström; Andrew Thomason 001; Peter Wagner 002 (Graphs Comb., 2011)

List Colourings of Regular Hypergraphs. - David Saxton; Andrew Thomason 001 (Comb. Probab. Comput., 2012)

Hereditary and Monotone Properties of Graphs. - Béla Bollobás; Andrew Thomason 001 (The Mathematics of Paul Erdős II, 2013)

On Minimum Saturated Matrices. - Andrzej Dudek; Oleg Pikhurko; Andrew Thomason 001 (Graphs Comb., 2013)

Simple Containers for Simple Hypergraphs. - David Saxton; Andrew Thomason 001 (Comb. Probab. Comput., 2016)

Online containers for hypergraphs, with applications to linear equations. - David Saxton; Andrew Thomason 001 (J. Comb. Theory B, 2016)

List colorings of multipartite hypergraphs. - Arès Méroueh; Andrew Thomason 001 (Random Struct. Algorithms, 2019)

A Lower Bound on the Average Degree Forcing a Minor. - Sergey Norin; Bruce A. Reed; Andrew Thomason 001; David R. Wood (Electron. J. Comb., 2020)

On the extremal function for graph minors. - Andrew Thomason 001; Matthew Wales (J. Graph Theory, 2022)