WELL COVERED SIMPLICIAL, CHORDAL, AND CIRCULAR-ARC GRAPHS

Authors
PRISNER E TOPP J VESTERGAARD PD
Citation
E. Prisner et al., WELL COVERED SIMPLICIAL, CHORDAL, AND CIRCULAR-ARC GRAPHS, Journal of graph theory, 21(2), 1996, pp. 113-119
Citations number
16
Categorie Soggetti
Mathematics, Pure",Mathematics
Journal title
Journal of graph theory → ACNP
ISSN journal
03649024
Volume
21
Issue
2
Year of publication
1996
Pages
113 - 119
Database
ISI
SICI code
0364-9024(1996)21:2<113:WCSCAC>2.0.ZU;2-B
Abstract
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 are graphs. (C) 1996 Jo hn Wiley & Sons, Inc.