Upper bounds to the clique width of graphs
type: Item
instance of: scholarly article
title: Upper bounds to the clique width of graphs
zbMATH Open document ID: 0958.05105
DOI: 10.1016/S0166-218X(99)00184-5
author: Stephan Olariu
author: Bruno Courcelle
published in: Discrete Applied Mathematics
publication date: 2001-03-30T00:00:00Z
review text: The authors bound the clique width of a graph in terms of its tree width and also in terms of the clique width of its edge complement.
reviewed by: Michael Raines
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C78
zbMATH DE Number: 1428618
zbMATH Keywords: hierarchical graph decomposition
zbMATH Keywords: modular decomposition
zbMATH Keywords: tree decomposition
zbMATH Keywords: algorithms
zbMATH Keywords: monadic second-order logic
Wikidata QID: Q56475000
MaRDI profile type: Publication
cites work: Easy problems for tree-decomposable graphs
cites work: An algebraic theory of graph reduction
cites work: A Linear Recognition Algorithm for Cographs
cites work: An axiomatic definition of context-free rewriting and its application to NLC graph grammars
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
cites work: The monadic second-order logic of graphs. VII: Graphs as relational structures
cites work: The monadic second-order logic of graphs. VIII: Orientations
cites work: Structural properties of context-free sets of graphs generated by vertex replacement
cites work: The monadic second-order logic of graphs. X: Linear orderings
cites work: Q4852905
cites work: Handle-rewriting hypergraph grammars
cites work: Monadic second-order evaluations on tree-decomposable graphs
cites work: Q4954442
cites work: Q4037316
cites work: Handbook of Graph Grammars and Computing by Graph Transformation
cites work: Incremental modular decomposition
cites work: Graph minors. V. Excluding a planar graph
cites work: The structure of the models of decidable monadic theories of graphs
cites work: Q4385515
cites work: \(k\)-NLC graphs and polynomial algorithms
full work available at URL: s0166-218x(99)00184-5
OpenAlex ID: W1993328543
description: scientific article; zbMATH DE number 1428618