Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
type: Item
instance of: scholarly article
title: Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
zbMATH Open document ID: 1238.05196
author: Pinar Heggernes
author: Daniel Meister
author: Charis Papadopoulos
published in: Discrete Applied Mathematics
publication date: 2012-05-11T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 6033768
zbMATH Keywords: clique-width
zbMATH Keywords: characterization via forbidden induced subgraphs
zbMATH Keywords: special graph classes
MaRDI profile type: Publication
full work available at URL: j.dam.2011.03.018
OpenAlex ID: W2060493079
cites work: Q4508369
cites work: A Linear Recognition Algorithm for Cographs
cites work: On the Relationship Between Clique-Width and Treewidth
cites work: Handle-rewriting hypergraph grammars
cites work: Upper bounds to the clique width of graphs
cites work: Clique-Width is NP-Complete
cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
cites work: Characterizations for co-graphs defined by restricted NLC-width or clique-width operations
cites work: Linear layouts measuring neighbourhoods in graphs
cites work: On the relationship between NLC-width and linear NLC-width
cites work: Graphs of Linear Clique-Width at Most 3
cites work: A Complete Characterisation of the Linear Clique-Width of Path Powers
cites work: The relative clique-width of a graph
cites work: Threshold graphs and related topics
DOI: 10.1016/J.DAM.2011.03.018
description: scientific article; zbMATH DE number 6033768