# Andrew Thomason

According to our database

Collaborative distances:

^{1}, Andrew Thomason authored at least 59 papers between 1981 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2020

Electron. J. Comb., 2020

2019

Random Struct. Algorithms, 2019

2016

J. Comb. Theory, Ser. B, 2016

Comb. Probab. Comput., 2016

2013

Graphs Comb., 2013

Proceedings of the Mathematics of Paul Erdős II, 2013

2012

Comb. Probab. Comput., 2012

2011

Graphs Comb., 2011

Comb. Probab. Comput., 2011

Comb., 2011

2010

Weighted spectral distribution for internet topology analysis: theory and applications.

IEEE/ACM Trans. Netw., 2010

Discret. Math., 2010

Comb. Probab. Comput., 2010

2009

Discret. Math., 2009

2008

J. Graph Theory, 2008

Discret. Math., 2008

Comb. Probab. Comput., 2008

2007

J. Graph Theory, 2007

Eur. J. Comb., 2007

Comb., 2007

2006

Discret. Math., 2006

2005

Comb., 2005

2004

Math. Comput., 2004

J. Comb. Theory, Ser. B, 2004

Comb. Probab. Comput., 2004

2003

Comb. Probab. Comput., 2003

2002

Discret. Math., 2002

2001

J. Comb. Theory, Ser. B, 2001

2000

Random Struct. Algorithms, 2000

On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphs.

J. Graph Theory, 2000

Electron. Notes Discret. Math., 2000

Comb., 2000

1999

J. Comb. Theory, Ser. B, 1999

1998

Proof of a Conjecture of Mader, Erdös and Hajnal on Topological Complete Subgraphs.

Eur. J. Comb., 1998

Comb. Probab. Comput., 1998

1997

J. Graph Theory, 1997

Comb., 1997

1996

Comb., 1996

Comb., 1996

1995

Random Struct. Algorithms, 1995

J. Cryptol., 1995

J. Graph Theory, 1995

1992

J. Graph Theory, 1992

Discret. Math., 1992

1991

Graphs Comb., 1991

Comb., 1991

An extremal function for the achromatic number.

Proceedings of the Graph Structure Theory, 1991

1989

Discret. Math., 1989

Discret. Math., 1989

Discret. Math., 1989

1988

J. Graph Theory, 1988

Eur. J. Comb., 1988

1987

Comb., 1987

1983

Discret. Appl. Math., 1983

1982

Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable.

J. Graph Theory, 1982

Eur. J. Comb., 1982

Discret. Math., 1982

1981

J. Comb. Theory, Ser. B, 1981

Eur. J. Comb., 1981