Premium
Well covered simplicial, chordal, and circular arc graphs
Author(s) -
Prisner Erich,
Topp Jerzy,
Vestergaard Preben Dahl
Publication year - 1996
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199602)21:2<113::aid-jgt1>3.0.co;2-u
Subject(s) - chordal graph , combinatorics , mathematics , interval graph , outerplanar graph , pathwidth , arc (geometry) , split graph , indifference graph , discrete mathematics , graph , 1 planar graph , line graph , geometry
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.