Results 1 
1 of
1
Asteroidal TripleFree Graphs
, 1997
"... . An independent set of three vertices such that each pair is joined by a path that avoids the neighborhood of the third is called an asteroidal triple. A graph is asteroidal triplefree (ATfree, for short) if it contains no asteroidal triples. The motivation for this investigation was provided, in ..."
Abstract

Cited by 55 (10 self)
 Add to MetaCart
. An independent set of three vertices such that each pair is joined by a path that avoids the neighborhood of the third is called an asteroidal triple. A graph is asteroidal triplefree (ATfree, for short) if it contains no asteroidal triples. The motivation for this investigation was provided, in part, by the fact that the asteroidal triplefree graphs provide a common generalization of interval, permutation, trapezoid, and cocomparability graphs. The main contribution of this work is to investigate and reveal fundamental structural properties of ATfree graphs. Specifically, we show that every connected ATfree graph contains a dominating pair, that is, a pair of vertices such that every path joining them is a dominating set in the graph. We then provide characterizations of ATfree graphs in terms of dominating pairs and minimal triangulations. Subsequently, we state and prove a decomposition theorem for ATfree graphs. An assortment of other properties of ATfree graphs is also p...