Kathie Cameron

Publication Activity (10 Years)

Years Active: 1986-2024
Publications (10 Years): 18

Top Topics

Bipartite Graph

Subgraph Isomorphism

Intersection Points

Top Venues

Discret. Appl. Math.

J. Graph Theory

Publications

Manoj Belavadi, Kathie Cameron, Ni Luh Dewi Sintiari
Recoloring via modular decomposition. CoRR (2024)
Manoj M. Belavadi, Kathie Cameron, Owen D. Merkel
Reconfiguration of vertex colouring and forbidden induced subgraphs. Eur. J. Comb. 118 (2024)
Kathie Cameron, Aristotelis Chaniotis, Celina M. H. de Figueiredo, Sophie Spirkl
The sandwich problem for odd-hole-free and even-hole-free graphs. CoRR (2024)
Kathie Cameron, Jack R. Edmonds
A PPA parity theorem about trees in a bipartite graph. Discret. Appl. Math. 308 (2022)
Kathie Cameron
A parity theorem about trees with specified degrees. Discret. Appl. Math. 305 (2021)
Kathie Cameron, Shenwei Huang, Owen D. Merkel
An optimal χ -bound for ( P 6 , diamond)-free graphs. J. Graph Theory 97 (3) (2021)
Kathie Cameron, Jan Goedgebeur, Shenwei Huang, Yongtang Shi
-free graphs. Theor. Comput. Sci. 864 (2021)
Kathie Cameron, Jan Goedgebeur, Shenwei Huang, Yongtang Shi
-Free Graphs. COCOON (2020)
Kathie Cameron, Carsten Thomassen
Cycles containing all the odd-degree vertices. J. Comb. Theory, Ser. B 143 (2020)
Kathie Cameron, Kristina Vuskovic
Hadwiger's Conjecture for some hereditary classes of graphs: a survey. Bull. EATCS 131 (2020)
Kathie Cameron, Shenwei Huang, Irena Penev, Vaidy Sivaraman
The class of ( P 7 , C 4 , C 5 ) -free graphs: Decomposition, algorithms, and χ -boundedness. J. Graph Theory 93 (4) (2020)
Kathie Cameron, Chính T. Hoàng
Solving the clique cover problem on (bull, C4)-free graphs. Discret. Appl. Math. 261 (2019)
Kathie Cameron, Shenwei Huang, Owen D. Merkel
, diamond)-Free Graphs. CoRR (2018)
Kathie Cameron, Steven Chaplick, Chính T. Hoàng
On the structure of (pan, even hole)-free graphs. J. Graph Theory 87 (1) (2018)
Kathie Cameron, Murilo V. G. da Silva, Shenwei Huang, Kristina Vuskovic
Structure and algorithms for (cap, even hole)-free graphs. Discret. Math. 341 (2) (2018)
Kathie Cameron, Chính T. Hoàng
)-free graphs. CoRR (2017)
Kathie Cameron, Murilo Vicente Gonçalves da Silva, Shenwei Huang, Kristina Vuskovic
Structure and algorithms for (cap, even hole)-free graphs. CoRR (2016)
Kathie Cameron, Steven Chaplick, Chính T. Hoàng
Edge intersection graphs of L-shaped paths in grids. Discret. Appl. Math. 210 (2016)
Kathie Cameron, Steven Chaplick, Chính T. Hoàng
On the structure of (pan, even hole)-free graphs. CoRR (2015)
Kathie Cameron, Steven Chaplick, Chính T. Hoàng
Edge Intersection Graphs of L-Shaped Paths in Grids. Electron. Notes Discret. Math. 44 (2013)
Kathie Cameron, Benjamin Lévêque, Frédéric Maffray
Coloring vertices of a graph or finding a Meyniel obstruction. Theor. Comput. Sci. 428 (2012)
Kathie Cameron, Steven Chaplick, Chính T. Hoàng
Edge Intersection Graphs of L-Shaped Paths in Grids CoRR (2012)
Kathie Cameron, Chính T. Hoàng, Benjamin Lévêque
Characterizing directed path graphs by forbidden asteroids. J. Graph Theory 68 (2) (2011)
Kathie Cameron, Chính T. Hoàng, Benjamin Lévêque
Asteroids in rooted and directed path graphs. Electron. Notes Discret. Math. 32 (2009)
Kathie Cameron
Brambles and independent packings in chordal graphs. Discret. Math. 309 (18) (2009)
Kathie Cameron, Joanna B. Fawcett
Intermediate Trees. CTW (2009)
Kathie Cameron, Jack R. Edmonds
The travelling preacher, projection, and a lower bound for the stability number of a graph. Discret. Optim. 5 (2) (2008)
Kathie Cameron, Chính T. Hoàng, Benjamin Lévêque
Asteroids in rooted and directed path graphs CoRR (2008)
Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan
The Complexity of the List Partition Problem for Graphs. SIAM J. Discret. Math. 21 (4) (2007)
Anthony Bonato, Kathie Cameron
On an adjacency property of almost all tournaments. Discret. Math. 306 (19-20) (2006)
Kathie Cameron, Chính T. Hoàng
On the structure of certain intersection graphs. Inf. Process. Lett. 99 (2) (2006)
Kathie Cameron, Pavol Hell
Independent packings in structured graphs. Math. Program. 105 (2-3) (2006)
Kathie Cameron, Jack R. Edmonds
Colouring Some Classes of Perfect Graphs Robustly. Electron. Notes Discret. Math. 22 (2005)
Kathie Cameron, Jack R. Edmonds, Benjamin Lévêque, Frédéric Maffray
Coloring vertices of a graph or finding a Meyniel obstruction CoRR (2005)
Kathie Cameron, Tracy Walker
The graphs with maximum induced matching and maximum matching the same size. Discret. Math. 299 (1-3) (2005)
Rodica Boliac, Kathie Cameron, Vadim V. Lozin
On computing the dissociation number and the induced matching number of bipartite graphs. Ars Comb. 72 (2004)
Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan
The list partition problem for graphs. SODA (2004)
Kathie Cameron
Induced matchings in intersection graphs. Discret. Math. 278 (1-3) (2004)
Kathie Cameron, R. Sritharan, Yingwen Tang
Finding a maximum induced matching in weakly chordal graphs. Discret. Math. 266 (1-3) (2003)
Kathie Cameron
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. 235 (1-3) (2001)
Anthony Bonato, Kathie Cameron
On an adjacency property of almost all graphs. Discret. Math. 231 (1-3) (2001)
Kathie Cameron
Connected Matchings. Combinatorial Optimization (2001)
Kathie Cameron
Induced Matchings in Intersection Graphs. Electron. Notes Discret. Math. 5 (2000)
Kathie Cameron
A Min-Max Relation for Monotone Path Systems in Simple Regions. Comb. 20 (3) (2000)
Anthony Bonato, Kathie Cameron
On 2-e.c. graphs, tournaments, and hypergraphs. Electron. Notes Discret. Math. 5 (2000)
Kathie Cameron, Jack R. Edmonds
Some Graphic Uses of an Even Number of Odd Nodes. SODA (1999)
Kathie Cameron, Jack R. Edmonds
Lambda composition. J. Graph Theory 26 (1) (1997)
Kathie Cameron
Coloured matchings in bipartite graphs. Discret. Math. 169 (1-3) (1997)
Kathie Cameron, Horst Sachs
Monotone Path Systems in Simple Regions. Comb. 14 (1) (1994)
Kathie Cameron, Jack R. Edmonds
Coflow polyhedra. Discret. Math. 101 (1-3) (1992)
Kathie Cameron
An algorithmic note on the gallai-milgram theorem. Networks 20 (1) (1990)
Kathie Cameron, Jack R. Edmonds
Existentially Polytime Theorems. Polyhedral Combinatorics (1990)
Kathie Cameron
Induced matchings. Discret. Appl. Math. 24 (1-3) (1989)
Kathie Cameron
A min-max relation for the partial q- colourings of a graph. Part II: Box perfection. Discret. Math. 74 (1-2) (1989)
Kathie Cameron
On k-Optimum Dipath Partitions and Partial k-Colourings of Acyclic Digraphs. Eur. J. Comb. 7 (2) (1986)