Kathie Cameron

According to our database1, Kathie Cameron authored at least 41 papers between 1986 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

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

Cycles containing all the odd-degree vertices.
J. Comb. Theory, Ser. B, 2020

k-Critical Graphs in P<sub>5</sub>-Free Graphs.
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019
Solving the clique cover problem on (bull, C4)-free graphs.
Discret. Appl. Math., 2019

2018
On the structure of (pan, even hole)-free graphs.
J. Graph Theory, 2018

Structure and algorithms for (cap, even hole)-free graphs.
Discret. Math., 2018

An Optimal χ-Bound for (P<sub>6</sub>, diamond)-Free Graphs.
CoRR, 2018

2017
Solving the clique cover problem on (bull, C<sub>4</sub>)-free graphs.
CoRR, 2017

2013
Edge Intersection Graphs of L-Shaped Paths in Grids.
Electron. Notes Discret. Math., 2013

2012
Coloring vertices of a graph or finding a Meyniel obstruction.
Theor. Comput. Sci., 2012

2011
Characterizing directed path graphs by forbidden asteroids.
J. Graph Theory, 2011

2009
Asteroids in rooted and directed path graphs.
Electron. Notes Discret. Math., 2009

Brambles and independent packings in chordal graphs.
Discret. Math., 2009

Intermediate Trees.
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
The Complexity of the List Partition Problem for Graphs.
SIAM J. Discret. Math., 2007

2006
Independent packings in structured graphs.
Math. Program., 2006

On the structure of certain intersection graphs.
Inf. Process. Lett., 2006

On an adjacency property of almost all tournaments.
Discret. Math., 2006

2005
Colouring Some Classes of Perfect Graphs Robustly.
Electron. Notes Discret. Math., 2005

The graphs with maximum induced matching and maximum matching the same size.
Discret. Math., 2005

Coloring vertices of a graph or finding a Meyniel obstruction
CoRR, 2005

2004
On computing the dissociation number and the induced matching number of bipartite graphs.
Ars Comb., 2004

The list partition problem for graphs.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003
Finding a maximum induced matching in weakly chordal graphs.
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

On an adjacency property of almost all graphs.
Discret. Math., 2001

Connected Matchings.
Proceedings of the Combinatorial Optimization, 2001

2000
Induced Matchings in Intersection Graphs.
Electron. Notes Discret. Math., 2000

On 2-e.c. graphs, tournaments, and hypergraphs.
Electron. Notes Discret. Math., 2000

A Min-Max Relation for Monotone Path Systems in Simple Regions.
Comb., 2000

1999
Some Graphic Uses of an Even Number of Odd Nodes.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1997
Lambda composition.
J. Graph Theory, 1997

Coloured matchings in bipartite graphs.
Discret. Math., 1997

1994
Monotone Path Systems in Simple Regions.
Comb., 1994

1992
Coflow polyhedra.
Discret. Math., 1992

1990
An algorithmic note on the gallai-milgram theorem.
Networks, 1990

Existentially Polytime Theorems.
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

Induced matchings.
Discret. Appl. Math., 1989

1986
On k-Optimum Dipath Partitions and Partial k-Colourings of Acyclic Digraphs.
Eur. J. Comb., 1986


  Loading...