Well-covered claw-free graphs
type: Item
instance of: scholarly article
title: Well-covered claw-free graphs
zbMATH Open document ID: 0858.05046
author: David Tankus
author: Michael Tarsi
published in: Journal of Combinatorial Theory. Series B
publication date: 1997-03-23T00:00:00Z
review text: The existence of a polynomial algorithm, to tell whether a claw-free graph is well covered, is proved.
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 934795
zbMATH Keywords: polynomial algorithm
zbMATH Keywords: claw-free graph
reviewed by: Martin Loebl
MaRDI profile type: Publication
full work available at URL: jctb.1996.0022
OpenAlex ID: W2029046796
DOI: 10.1006/JCTB.1996.0022
description: scientific article; zbMATH DE number 934795