Asteroidal triple-free graphs. Recursively decomposable well-covered graphs. A linear time algorithm to compute a dominating path in an AT-free graph. Partitioning vertices of chordal graphs. On cocolourings and cochromatic numbers of graphs.
Complexity results for well-covered graphs.
Dominating sets in perfect graphs. Bipartite permutation graphs are bipartite tolerance graphs. Bipartite permutation graphs. Locating dominating sets in series parallel networks. Permutation graph structure.