default search action
Kathie Cameron
Person information
- affiliation: Wilfrid Laurier University, Department of Mathematics, Waterloo, ON, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j40]Manoj M. Belavadi
, Kathie Cameron
Reconfiguration of vertex colouring and forbidden induced subgraphs. Eur. J. Comb. 118: 103908 (2024) - [i9]Kathie Cameron, Aristotelis Chaniotis, Celina M. H. de Figueiredo, Sophie Spirkl:
The sandwich problem for odd-hole-free and even-hole-free graphs. CoRR abs/2404.10888 (2024) - [i8]Manoj M. Belavadi, Kathie Cameron, Ni Luh Dewi Sintiari:
Recoloring via modular decomposition. CoRR abs/2405.06446 (2024) - 2022
- [j39]Kathie Cameron
A PPA parity theorem about trees in a bipartite graph. Discret. Appl. Math. 308: 107-110 (2022) - 2021
- [j38]Kathie Cameron
A parity theorem about trees with specified degrees. Discret. Appl. Math. 305: 48-55 (2021) - [j37]Kathie Cameron
An optimal χ -bound for ( P 6 , diamond)-free graphs. J. Graph Theory 97(3): 451-465 (2021) - [j36]Kathie Cameron, Jan Goedgebeur
k-Critical graphs in P5-free graphs. Theor. Comput. Sci. 864: 80-91 (2021) - 2020
- [j35]Kathie Cameron, Kristina Vuskovic:
Hadwiger's Conjecture for some hereditary classes of graphs: a survey. Bull. EATCS 131 (2020) - [j34]Kathie Cameron, Carsten Thomassen
Cycles containing all the odd-degree vertices. J. Comb. Theory B 143: 219-225 (2020) - [j33]Kathie Cameron, Shenwei Huang, Irena Penev
The class of ( P 7 , C 4 , C 5 ) -free graphs: Decomposition, algorithms, and χ -boundedness. J. Graph Theory 93(4): 503-552 (2020) - [c6]Kathie Cameron, Jan Goedgebeur
k-Critical Graphs in P5-Free Graphs. COCOON 2020: 411-422
2010 – 2019
- 2019
- [j32]Kathie Cameron, Chính T. Hoàng:
Solving the clique cover problem on (bull, C4)-free graphs. Discret. Appl. Math. 261: 119-122 (2019) - 2018
- [j31]Kathie Cameron, Murilo V. G. da Silva
Structure and algorithms for (cap, even hole)-free graphs. Discret. Math. 341(2): 463-473 (2018) - [j30]Kathie Cameron, Steven Chaplick
On the structure of (pan, even hole)-free graphs. J. Graph Theory 87(1): 108-129 (2018) - [i7]Kathie Cameron, Shenwei Huang, Owen D. Merkel:
An Optimal χ-Bound for (P6, diamond)-Free Graphs. CoRR abs/1809.00739 (2018) - 2017
- [i6]Kathie Cameron, Chính T. Hoàng:
Solving the clique cover problem on (bull, C4)-free graphs. CoRR abs/1704.00316 (2017) - 2016
- [j29]Kathie Cameron, Steven Chaplick
Edge intersection graphs of L-shaped paths in grids. Discret. Appl. Math. 210: 185-194 (2016) - [i5]Kathie Cameron, Murilo Vicente Gonçalves da Silva, Shenwei Huang, Kristina Vuskovic:
Structure and algorithms for (cap, even hole)-free graphs. CoRR abs/1611.08066 (2016) - 2015
- [i4]Kathie Cameron, Steven Chaplick, Chính T. Hoàng:
On the structure of (pan, even hole)-free graphs. CoRR abs/1508.03062 (2015) - 2013
- [j28]Kathie Cameron, Steven Chaplick
Edge Intersection Graphs of L-Shaped Paths in Grids. Electron. Notes Discret. Math. 44: 363-369 (2013) - 2012
- [j27]Kathie Cameron, Benjamin Lévêque, Frédéric Maffray:
Coloring vertices of a graph or finding a Meyniel obstruction. Theor. Comput. Sci. 428: 10-17 (2012) - [i3]Kathie Cameron, Steven Chaplick, Chính T. Hoàng:
Edge Intersection Graphs of L-Shaped Paths in Grids. CoRR abs/1204.5702 (2012) - 2011
- [j26]Kathie Cameron, Chính T. Hoàng, Benjamin Lévêque:
Characterizing directed path graphs by forbidden asteroids. J. Graph Theory 68(2): 103-112 (2011)
2000 – 2009
- 2009
- [j25]Kathie Cameron:
Brambles and independent packings in chordal graphs. Discret. Math. 309(18): 5766-5769 (2009) - [j24]Kathie Cameron, Chính T. Hoàng, Benjamin Lévêque:
Asteroids in rooted and directed path graphs. Electron. Notes Discret. Math. 32: 67-74 (2009) - [c5]Kathie Cameron, Joanna B. Fawcett:
Intermediate Trees. CTW 2009: 120-121 - 2008
- [j23]Kathie Cameron, Jack Edmonds:
The travelling preacher, projection, and a lower bound for the stability number of a graph. Discret. Optim. 5(2): 290-292 (2008) - [i2]Kathie Cameron, Chính T. Hoàng, Benjamin Lévêque:
Asteroids in rooted and directed path graphs. CoRR abs/0812.2734 (2008) - 2007
- [j22]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): 900-929 (2007) - 2006
- [j21]Anthony Bonato, Kathie Cameron:
On an adjacency property of almost all tournaments. Discret. Math. 306(19-20): 2327-2335 (2006) - [j20]Kathie Cameron, Chính T. Hoàng:
On the structure of certain intersection graphs. Inf. Process. Lett. 99(2): 59-63 (2006) - [j19]Kathie Cameron, Pavol Hell:
Independent packings in structured graphs. Math. Program. 105(2-3): 201-213 (2006) - 2005
- [j18]Kathie Cameron, Tracy Walker:
The graphs with maximum induced matching and maximum matching the same size. Discret. Math. 299(1-3): 49-55 (2005) - [j17]Kathie Cameron, Jack Edmonds:
Colouring Some Classes of Perfect Graphs Robustly. Electron. Notes Discret. Math. 22: 553-556 (2005) - [i1]Kathie Cameron, Jack Edmonds, Benjamin Lévêque, Frédéric Maffray:
Coloring vertices of a graph or finding a Meyniel obstruction. CoRR abs/cs/0509023 (2005) - 2004
- [j16]Rodica Boliac, Kathie Cameron, Vadim V. Lozin:
On computing the dissociation number and the induced matching number of bipartite graphs. Ars Comb. 72 (2004) - [j15]Kathie Cameron:
Induced matchings in intersection graphs. Discret. Math. 278(1-3): 1-9 (2004) - [c4]Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan:
The list partition problem for graphs. SODA 2004: 391-399 - 2003
- [j14]Kathie Cameron, R. Sritharan, Yingwen Tang:
Finding a maximum induced matching in weakly chordal graphs. Discret. Math. 266(1-3): 133-142 (2003) - 2001
- [j13]Anthony Bonato, Kathie Cameron:
On an adjacency property of almost all graphs. Discret. Math. 231(1-3): 103-119 (2001) - [j12]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): 69-77 (2001) - [c3]Kathie Cameron:
Connected Matchings. Combinatorial Optimization 2001: 34-38 - 2000
- [j11]Kathie Cameron:
A Min-Max Relation for Monotone Path Systems in Simple Regions. Comb. 20(3): 435-440 (2000) - [j10]Anthony Bonato, Kathie Cameron:
On 2-e.c. graphs, tournaments, and hypergraphs. Electron. Notes Discret. Math. 5: 31-34 (2000) - [j9]Kathie Cameron:
Induced Matchings in Intersection Graphs. Electron. Notes Discret. Math. 5: 50-52 (2000)
1990 – 1999
- 1999
- [c2]Kathie Cameron, Jack Edmonds:
Some Graphic Uses of an Even Number of Odd Nodes. SODA 1999: 872 - 1997
- [j8]Kathie Cameron:
Coloured matchings in bipartite graphs. Discret. Math. 169(1-3): 205-209 (1997) - [j7]Kathie Cameron, Jack Edmonds:
Lambda composition. J. Graph Theory 26(1): 9-16 (1997) - 1994
- [j6]Kathie Cameron, Horst Sachs:
Monotone Path Systems in Simple Regions. Comb. 14(1): 1-21 (1994) - 1992
- [j5]Kathie Cameron, Jack Edmonds:
Coflow polyhedra. Discret. Math. 101(1-3): 1-21 (1992) - 1990
- [j4]Kathie Cameron:
An algorithmic note on the gallai-milgram theorem. Networks 20(1): 43-48 (1990) - [c1]Kathie Cameron, Jack Edmonds:
Existentially Polytime Theorems. Polyhedral Combinatorics 1990: 83-100
1980 – 1989
- 1989
- [j3]Kathie Cameron:
Induced matchings. Discret. Appl. Math. 24(1-3): 97-102 (1989) - [j2]Kathie Cameron:
A min-max relation for the partial q- colourings of a graph. Part II: Box perfection. Discret. Math. 74(1-2): 15-27 (1989) - 1986
- [j1]Kathie Cameron:
On k-Optimum Dipath Partitions and Partial k-Colourings of Acyclic Digraphs. Eur. J. Comb. 7(2): 115-118 (1986)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 19:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: