Pure simplicial complexes and well-covered graphs
Work
Year: 2015
Type: article
Abstract: In this paper, we provide some necessary and sufficient conditions to check when a (semi-)perfect graph is well-covered. We show that the checking process of these conditions can be achieved in a poly... more
Author Rashid Zaare-Nahandi
Institution Institute for Advanced Studies in Basic Sciences
Cites: 15
Cited by: 6
Related to: 10
FWCI: 1.032
Citation percentile (by year/subfield): 58.32
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid