A local characterization of bounded clique-width for line graphs
type: Item
instance of: scholarly article
title: A local characterization of bounded clique-width for line graphs
zbMATH Open document ID: 1114.05088
author: Frank Gurski
author: Egon Wanke
published in: Discrete Mathematics
publication date: 2007-03-02T00:00:00Z
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 5130432
zbMATH Keywords: NLC-width
zbMATH Keywords: co-gem-free line graphs
MaRDI profile type: Publication
full work available at URL: j.disc.2006.07.004
OpenAlex ID: W2006089834
cites work: Q4414485
cites work: Fundamentals of Computation Theory
cites work: GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
cites work: Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
cites work: Linear time solvable optimization problems on graphs of bounded clique-width
cites work: Monadic second-order evaluations on tree-decomposable graphs
cites work: Upper bounds to the clique width of graphs
cites work: Graph-Theoretic Concepts in Computer Science
cites work: On the relationship between NLC-width and linear NLC-width
cites work: Q4489221
cites work: Graph minors. I. Excluding a forest
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: \(k\)-NLC graphs and polynomial algorithms
DOI: 10.1016/J.DISC.2006.07.004
description: scientific article; zbMATH DE number 5130432