Kathie Cameron

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