A new graph construction of unbounded clique-width
type: Item
instance of: scholarly article
title: A new graph construction of unbounded clique-width
zbMATH Open document ID: 1355.05188
author: Nicholas Korpelainen
publication date: 2017-02-09T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 6682407
zbMATH Keywords: hereditary graph classes
zbMATH Keywords: clique-width
MaRDI profile type: Publication
full work available at URL: j.endm.2016.11.005
OpenAlex ID: W2559266576
cites work: On easy and hard hereditary classes of graphs with respect to the independent set problem
cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees
cites work: Q4425939
cites work: Q5463359
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: Bipartite Graphs of Large Clique-Width
cites work: Q5487903
cites work: THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES
cites work: Minimal classes of graphs of unbounded clique-width
cites work: Graph minors. V. Excluding a planar graph
DOI: 10.1016/J.ENDM.2016.11.005
description: scientific article; zbMATH DE number 6682407