Clique-width of graphs defined by one-vertex extensions
type: Item
instance of: scholarly article
title: Clique-width of graphs defined by one-vertex extensions
zbMATH Open document ID: 1180.05081
author: Michaël Rao
published in: Discrete Mathematics
publication date: 2009-01-28T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 5499756
zbMATH Keywords: graph classes
zbMATH Keywords: vertex extension
zbMATH Keywords: cographs
zbMATH Keywords: distance-hereditary graphs
zbMATH Keywords: clique-width
MaRDI profile type: Publication
full work available at URL: j.disc.2007.11.039
OpenAlex ID: W2079306871
cites work: Distance-hereditary graphs
cites work: GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
cites work: Complement reducible graphs
cites work: Handle-rewriting hypergraph grammars
cites work: Decomposition of Directed Graphs
cites work: Transitiv orientierbare Graphen
cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
cites work: Characterizations for restricted graphs of NLC-width 2
cites work: Completely separable graphs
cites work: Q4489221
cites work: The bi-join decomposition
cites work: Approximating clique-width and branch-width
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: Graphs indecomposable with respect to the X-join
cites work: \(k\)-NLC graphs and polynomial algorithms
DOI: 10.1016/J.DISC.2007.11.039
description: scientific article; zbMATH DE number 5499756