# Kathie Cameron

According to our database

Collaborative distances:

^{1}, Kathie Cameron authored at least 41 papers between 1986 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2020

The class of ( P 7 , C 4 , C 5 ) -free graphs: Decomposition, algorithms, and χ -boundedness.

J. Graph Theory, 2020

J. Comb. Theory, Ser. B, 2020

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019

Discret. Appl. Math., 2019

2018

J. Graph Theory, 2018

Discret. Math., 2018

CoRR, 2018

2017

CoRR, 2017

2013

Electron. Notes Discret. Math., 2013

2012

Theor. Comput. Sci., 2012

2011

J. Graph Theory, 2011

2009

Electron. Notes Discret. Math., 2009

Discret. Math., 2009

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008

The travelling preacher, projection, and a lower bound for the stability number of a graph.

Discret. Optim., 2008

2007

SIAM J. Discret. Math., 2007

2006

Math. Program., 2006

Inf. Process. Lett., 2006

Discret. Math., 2006

2005

Electron. Notes Discret. Math., 2005

Discret. Math., 2005

CoRR, 2005

2004

On computing the dissociation number and the induced matching number of bipartite graphs.

Ars Comb., 2004

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003

Discret. Math., 2003

2001

Thomason's algorithm for finding a second hamiltonian circuit through a given edge in a cubic graph is exponential on Krawczyk's graphs.

Discret. Math., 2001

Discret. Math., 2001

Proceedings of the Combinatorial Optimization, 2001

2000

Electron. Notes Discret. Math., 2000

Electron. Notes Discret. Math., 2000

Comb., 2000

1999

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1997

J. Graph Theory, 1997

Discret. Math., 1997

1994

Comb., 1994

1992

Discret. Math., 1992

1990

Networks, 1990

Proceedings of the Polyhedral Combinatorics, 1990

1989

A min-max relation for the partial q- colourings of a graph. Part II: Box perfection.

Discret. Math., 1989

Discret. Appl. Math., 1989

1986

Eur. J. Comb., 1986