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

Induced matchings. - Kathie Cameron (Discret. Appl. Math., 1989)

A min-max relation for the partial q- colourings of a graph. Part II: Box perfection. - Kathie Cameron (Discret. Math., 1989)

Existentially Polytime Theorems. - Kathie Cameron; Jack Edmonds 001 (Polyhedral Combinatorics, 1990)

An algorithmic note on the gallai-milgram theorem. - Kathie Cameron (Networks, 1990)

Coflow polyhedra. - Kathie Cameron; Jack Edmonds 001 (Discret. Math., 1992)

Monotone Path Systems in Simple Regions. - Kathie Cameron; Horst Sachs (Comb., 1994)

Coloured matchings in bipartite graphs. - Kathie Cameron (Discret. Math., 1997)

Lambda composition. - Kathie Cameron; Jack Edmonds 001 (J. Graph Theory, 1997)

Some Graphic Uses of an Even Number of Odd Nodes. - Kathie Cameron; Jack Edmonds 001 (SODA, 1999)

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

On 2-e.c. graphs, tournaments, and hypergraphs. - Anthony Bonato; Kathie Cameron (Electron. Notes Discret. Math., 2000)

Induced Matchings in Intersection Graphs. - Kathie Cameron (Electron. Notes Discret. Math., 2000)

Connected Matchings. - Kathie Cameron (Combinatorial Optimization, 2001)

On an adjacency property of almost all graphs. - Anthony Bonato; Kathie Cameron (Discret. Math., 2001)

Thomason's algorithm for finding a second hamiltonian circuit through a given edge in a cubic graph is exponential on Krawczyk's graphs. - Kathie Cameron (Discret. Math., 2001)

Finding a maximum induced matching in weakly chordal graphs. - Kathie Cameron; R. Sritharan; Yingwen Tang (Discret. Math., 2003)

The list partition problem for graphs. - Kathie Cameron; Elaine M. Eschen; Chính T. Hoàng; R. Sritharan (SODA, 2004)

On computing the dissociation number and the induced matching number of bipartite graphs. - Rodica Boliac; Kathie Cameron; Vadim V. Lozin (Ars Comb., 2004)

Coloring vertices of a graph or finding a Meyniel obstruction - Kathie Cameron; Jack Edmonds 001; Benjamin Lévêque; Frédéric Maffray (CoRR, 2005)

The graphs with maximum induced matching and maximum matching the same size. - Kathie Cameron; Tracy Walker (Discret. Math., 2005)

Colouring Some Classes of Perfect Graphs Robustly. - Kathie Cameron; Jack Edmonds 001 (Electron. Notes Discret. Math., 2005)

On an adjacency property of almost all tournaments. - Anthony Bonato; Kathie Cameron (Discret. Math., 2006)

On the structure of certain intersection graphs. - Kathie Cameron; Chính T. Hoàng (Inf. Process. Lett., 2006)

Independent packings in structured graphs. - Kathie Cameron; Pavol Hell (Math. Program., 2006)

The Complexity of the List Partition Problem for Graphs. - Kathie Cameron; Elaine M. Eschen; Chính T. Hoàng; R. Sritharan (SIAM J. Discret. Math., 2007)

The travelling preacher, projection, and a lower bound for the stability number of a graph. - Kathie Cameron; Jack Edmonds 001 (Discret. Optim., 2008)

Intermediate Trees. - Kathie Cameron; Joanna B. Fawcett (CTW, 2009)

Brambles and independent packings in chordal graphs. - Kathie Cameron (Discret. Math., 2009)

Asteroids in rooted and directed path graphs. - Kathie Cameron; Chính T. Hoàng; Benjamin Lévêque (Electron. Notes Discret. Math., 2009)

Characterizing directed path graphs by forbidden asteroids. - Kathie Cameron; Chính T. Hoàng; Benjamin Lévêque (J. Graph Theory, 2011)

Coloring vertices of a graph or finding a Meyniel obstruction. - Kathie Cameron; Benjamin Lévêque; Frédéric Maffray (Theor. Comput. Sci., 2012)

Edge intersection graphs of L-shaped paths in grids. - Kathie Cameron; Steven Chaplick; Chính T. Hoàng (Discret. Appl. Math., 2016)

Solving the clique cover problem on (bull, C4)-free graphs. - Kathie Cameron; Chính T. Hoàng (CoRR, 2017)

An Optimal χ-Bound for (P6, diamond)-Free Graphs. - Kathie Cameron; Shenwei Huang; Owen D. Merkel (CoRR, 2018)

Structure and algorithms for (cap, even hole)-free graphs. - Kathie Cameron; Murilo V. G. da Silva; Shenwei Huang; Kristina Vuskovic (Discret. Math., 2018)

On the structure of (pan, even hole)-free graphs. - Kathie Cameron; Steven Chaplick; Chính T. Hoàng (J. Graph Theory, 2018)

Solving the clique cover problem on (bull, C4)-free graphs. - Kathie Cameron; Chính T. Hoàng (Discret. Appl. Math., 2019)

k-Critical Graphs in P5-Free Graphs. - Kathie Cameron; Jan Goedgebeur; Shenwei Huang; Yongtang Shi (COCOON, 2020)

Hadwiger's Conjecture for some hereditary classes of graphs: a survey. - Kathie Cameron; Kristina Vuskovic (Bull. EATCS, 2020)

Cycles containing all the odd-degree vertices. - Kathie Cameron; Carsten Thomassen (J. Comb. Theory B, 2020)

The class of ( P 7 , C 4 , C 5 ) -free graphs: Decomposition, algorithms, and χ -boundedness. - Kathie Cameron; Shenwei Huang; Irena Penev; Vaidy Sivaraman (J. Graph Theory, 2020)

A parity theorem about trees with specified degrees. - Kathie Cameron (Discret. Appl. Math., 2021)

An optimal χ -bound for ( P 6 , diamond)-free graphs. - Kathie Cameron; Shenwei Huang; Owen D. Merkel (J. Graph Theory, 2021)

k-Critical graphs in P5-free graphs. - Kathie Cameron; Jan Goedgebeur; Shenwei Huang; Yongtang Shi (Theor. Comput. Sci., 2021)

A PPA parity theorem about trees in a bipartite graph. - Kathie Cameron; Jack Edmonds 001 (Discret. Appl. Math., 2022)

Recoloring via modular decomposition. - Manoj M. Belavadi; Kathie Cameron; Ni Luh Dewi Sintiari (CoRR, 2024)

Reconfiguration of vertex colouring and forbidden induced subgraphs. - Manoj M. Belavadi; Kathie Cameron; Owen D. Merkel (Eur. J. Comb., 2024)

Frozen Colourings in $2K_2$-free graphs. - Manoj M. Belavadi; Kathie Cameron; Elias Hildred (Electron. J. Comb., 2025)

Recoloring some hereditary graph classes. - Manoj M. Belavadi; Kathie Cameron (Discret. Appl. Math., 2025)

The sandwich problem for odd-hole-free and even-hole-free graphs. - Kathie Cameron; Aristotelis Chaniotis; Celina M. H. de Figueiredo; Sophie Spirkl (Discret. Math., 2025)