16 citations · 28 across the 10 of their papers we have counts for
6 papers · 1 filter
Solving the clique cover problem on (bull, )-free graphs
Kathie Cameron, Chính T. Hoàng
We give an algorithm to find a minimum clique cover of a (bull, )-free graph, or equivalently, a minimum colouring of a (bull, )-free graph, where is the nu…
Structure and algorithms for (cap, even hole)-free graphs
Kathie Cameron, Murilo V. G. da Silva, Shenwei Huang +1
A graph is even-hole-free if it has no induced even cycles of length 4 or more. A cap is a cycle of length at least 5 with exactly one chord and that chord creates a triangle with…
On the structure of (pan, even hole)-free graphs
Kathie Cameron, Steven Chaplick, Chinh T. Hoang
A hole is a chordless cycle with at least four vertices. A pan is a graph which consists of a hole and a single vertex with precisely one neighbor on the hole. An even hole is a ho…
Edge Intersection Graphs of L-Shaped Paths in Grids
Kathie Cameron, Steven Chaplick, Chính T. Hoàng
In this paper we continue the study of the edge intersection graphs of one (or zero) bend paths on a rectangular grid. That is, the edge intersection graphs where each vertex is re…
Asteroids in rooted and directed path graphs
Kathie Cameron, Chinh Hoàng, Benjamin Lévêque
An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighborhood of the third vertex. Asteroidal triples play a central r…
Coloring vertices of a graph or finding a Meyniel obstruction
Kathie Cameron, Jack Edmonds, Benjamin Lévêque +1
A Meyniel obstruction is an odd cycle with at least five vertices and at most one chord. A graph is Meyniel if and only if it has no Meyniel obstruction as an induced subgraph. Her…