K
Kathie Cameron
Researcher at Wilfrid Laurier University
Publications - 50
Citations - 829
Kathie Cameron is an academic researcher from Wilfrid Laurier University. The author has contributed to research in topics: Chordal graph & Split graph. The author has an hindex of 15, co-authored 49 publications receiving 729 citations.
Papers
More filters
Journal ArticleDOI
Finding a maximum induced matching in weakly chordal graphs
TL;DR: It is shown that a maximum induced matching in a weakly chordal graph can be found in polynomial time and this generalizes previously known results for the induced matching problem.
Journal ArticleDOI
Induced matchings in intersection graphs
TL;DR: It is shown that if G is a polygon-circle graph, then so is [ L ( G )] 2 , and the same holds for asteroidal triple-free and interval-filament graphs, and it follows that the induced matching problem is polytime-solvable in these classes.
Journal ArticleDOI
The graphs with maximum induced matching and maximum matching the same size
Kathie Cameron,Tracy Walker +1 more
TL;DR: This work gives a simple characterization of graphs and provides a simpler recognition algorithm for finding a maximum induced matching in a graph where equality holds.
Journal ArticleDOI
Independent packings in structured graphs
Kathie Cameron,Pavol Hell +1 more
TL;DR: It is shown that packing a maximum number of independent triangles is polynomial-time solvable for many classes of structured graphs, including weakly chordal graphs, asteroidal triple-free graphs, polygon-circle graphs, and interval-filament graphs.