|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3 occurrences of 3 keywords
|
|
|
|
|
Results
Found 41 publication records. Showing 41 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Thomas Böhme, Alexandr V. Kostochka, Andrew Thomason |
Minors in Graphs with High Chromatic Number.  |
Combinatorics, Probability & Computing  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Klas Markström, Andrew Thomason, Peter Wagner 0002 |
Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree.  |
Graphs and Combinatorics  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Edward Marchant, Andrew Thomason |
The structure of hereditary properties and 2-coloured multigraphs.  |
Combinatorica  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Böhme, Alexandr V. Kostochka, Andrew Thomason |
Hadwiger numbers and over-dominating colourings.  |
Discrete Mathematics  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomasz Luczak, Andrew Thomason |
Vicarious Graphs.  |
Combinatorics, Probability & Computing  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Damien Fay, Hamed Haddadi, Andrew Thomason, Andrew W. Moore, Richard Mortier, Almerima Jamakovic, Steve Uhlig, Miguel Rio |
Weighted spectral distribution for internet topology analysis: theory and applications.  |
IEEE/ACM Trans. Netw.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Thomason, Peter Wagner 0002 |
Bounding the size of square-free subgraphs of the hypercube.  |
Discrete Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Thomason |
Disjoint unions of complete minors.  |
Discrete Mathematics  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson, Andrew Thomason |
Dismantling Sparse Random Graphs.  |
Combinatorics, Probability & Computing  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Penny E. Haxell, Oleg Pikhurko, Andrew Thomason |
Maximum acyclic and fragmented sets in regular graphs.  |
Journal of Graph Theory  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Thomason |
Disjoint complete minors and bipartite minors.  |
Eur. J. Comb.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Louigi Addario-Berry, Ketan Dalal, Colin McDiarmid, Bruce A. Reed, Andrew Thomason |
Vertex-Colouring Edge-Weightings.  |
Combinatorica  |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C15 |
| 1 | Andrew Thomason, Peter Wagner 0002 |
Complete graphs with no rainbow path.  |
Journal of Graph Theory  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Béla Bollobás, Andrew Thomason |
Set colourings of graphs.  |
Discrete Mathematics  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Samuel Myers, Andrew Thomason |
The Extremal Function For Noncomplete Minors.  |
Combinatorica  |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C83, 05C35 |
| 1 | William H. Cunningham, Penny E. Haxell, R. Bruce Richter, Nicholas C. Wormald, Andrew Thomason |
To Adrian Bondy and U. S. R. Murty.  |
J. Comb. Theory, Ser. B  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Thomason |
Two Minor Problems.  |
Combinatorics, Probability & Computing  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Felix Lazebnik, Andrew Thomason |
Orthomorphisms and the construction of projective planes.  |
Math. Comput.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Béla Bollobás, Andrew Thomason |
Frank Ramsey.  |
Combinatorics, Probability & Computing  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Pikhurko, Andrew Thomason |
Disjoint subgraphs of large maximum degree.  |
Discrete Mathematics  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Thomason |
The Extremal Function for Complete Minors.  |
J. Comb. Theory, Ser. B  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Thomason |
Subdivisions, linking, minors, and extremal functions.  |
Electronic Notes in Discrete Mathematics  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Thomason |
Complete minors in pseudorandom graphs.  |
Random Struct. Algorithms  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Béla Bollobás, Andrew Thomason |
The Structure of Hereditary Properties and Colourings of Random Graphs.  |
Combinatorica  |
2000 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05C80, 05C15, 05C75 |
| 1 | Béla Bollobás, Andrew Thomason |
Weakly Pancyclic Graphs.  |
J. Comb. Theory, Ser. B  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Béla Bollobás, Andrew Thomason |
Proof of a Conjecture of Mader, Erdös and Hajnal on Topological Complete Subgraphs.  |
Eur. J. Comb.  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard H. Schelp, Andrew Thomason |
A Remark on the Number of Complete and Empty Subgraphs.  |
Combinatorics, Probability & Computing  |
1998 |
DBLP BibTeX RDF |
|
| 1 | Andrew Thomason |
Graph Products and Monochromatic Multiplicities.  |
Combinatorica  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Jagger, Pavel Stovícek, Andrew Thomason |
Multiplicities of Subgraphs.  |
Combinatorica  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Béla Bollobás, Andrew Thomason |
Highly Linked Graphs.  |
Combinatorica  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Béla Bollobás, Andrew Thomason |
Generalized Chromatic Numbers of Random Graphs.  |
Random Struct. Algorithms  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Trevor I. Fenner, Alan M. Frieze, Andrew Thomason |
On Key Storage in Secure Networks.  |
J. Cryptology  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Julie Haviland, Andrew Thomason |
On testing the 'pseudo-randomness' of a hypergraph.  |
Discrete Mathematics  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Julie Haviland, Andrew Thomason |
Rotation numbers for complete tripartite graphs.  |
Graphs and Combinatorics  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Roland Häggkvist, Andrew Thomason |
Trees in tournaments.  |
Combinatorica  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Béla Bollobás, Bruce A. Reed, Andrew Thomason |
An extremal function for the achromatic number.  |
Graph Structure Theory  |
1991 |
DBLP BibTeX RDF |
|
| 1 | Andrew Thomason |
Dense expanders and pseudo-random bipartite graphs.  |
Discrete Mathematics  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Julie Haviland, Andrew Thomason |
Pseudo-random hypergraphs.  |
Discrete Mathematics  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Thomason |
A simple linear expected time algorithm for finding a hamilton path.  |
Discrete Mathematics  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Béla Bollobás, Andrew Thomason |
Threshold functions.  |
Combinatorica  |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Thomason |
Critically partitionable graphs II.  |
Discrete Mathematics  |
1982 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #41 of 41 (100 per page; Change: )
|
|