Well covered simplicial, chordal, and circular arc graphs
Erich Prisner, Jerzy Topp, Preben Dahl Vestergaard · VBN Forskningsportal (Aalborg Universitet) · 1996
A graph G is called well covered if every two maximal independent sets of G have the same number of vertices. In this paper, we characterize well covered simplicial, chordal and circular arc graphs. © 1996 John Wiley & Sons, Inc.