Clique-width with an inactive label
type: Item
instance of: scholarly article
title: Clique-width with an inactive label
zbMATH Open document ID: 1301.05108
author: Daniel Meister
published in: Discrete Mathematics
publication date: 2014-10-31T00:00:00Z
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 6362905
zbMATH Keywords: clique-width
zbMATH Keywords: linear clique-width
zbMATH Keywords: characterisation
zbMATH Keywords: forbidden induced subgraphs
zbMATH Keywords: distance-hereditary graphs
MaRDI profile type: Publication
full work available at URL: j.disc.2014.08.005
OpenAlex ID: W2048502143
cites work: Obstructions for linear rank-width at most 1
cites work: Linear Rank-Width and Linear Clique-Width of Trees
cites work: Distance-hereditary graphs
cites work: Linear Clique‐Width for Hereditary Classes of Cographs
cites work: Claw-free graphs. III: Circular interval graphs
cites work: Polynomial-time recognition of clique-width \(\leq 3\) graphs
cites work: Complement reducible graphs
cites work: Handle-rewriting hypergraph grammars
cites work: Linear time solvable optimization problems on graphs of bounded clique-width
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: Completely separable graphs
cites work: Graphs of linear clique-width at most 3
cites work: Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
cites work: Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width
cites work: A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
cites work: The relative clique-width of a graph
cites work: Rank-width and vertex-minors
cites work: Approximating clique-width and branch-width
DOI: 10.1016/J.DISC.2014.08.005
description: scientific article; zbMATH DE number 6362905