Recursively decomposable well-covered graphs
type: Item
instance of: scholarly article
title: Recursively decomposable well-covered graphs
zbMATH Open document ID: 0870.05057
DOI: 10.1016/0012-365X(95)00232-L
author: Ramesh S. Sankaranarayana
author: Lorna Stewart
published in: Discrete Mathematics
publication date: 1997-09-17T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 1018489
zbMATH Keywords: characterization
zbMATH Keywords: well-covered graphs
zbMATH Keywords: independent sets
zbMATH Keywords: recursively decomposable
zbMATH Keywords: isolated vertices
MaRDI profile type: Publication
cites work: Q3919752
cites work: Q5422499
cites work: Q3139761
cites work: Very well covered graphs
cites work: Some covering concepts in graphs
cites work: WELL-COVERED GRAPHS: A SURVEY
cites work: Complexity results for well‐covered graphs
full work available at URL: 0012-365x(95)00232-l
OpenAlex ID: W1991495793
description: scientific article; zbMATH DE number 1018489