Showing cs.DMShow all
2 papers · 1 filter
cs.DM2008
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…
cs.DM2005
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…