Minimal classes of graphs of unbounded clique-width
type: Item
instance of: scholarly article
title: Minimal classes of graphs of unbounded clique-width
zbMATH Open document ID: 1234.05191
author: Vadim Lozin
published in: Annals of Combinatorics
publication date: 2012-01-24T00:00:00Z
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 5999803
zbMATH Keywords: clique-width
zbMATH Keywords: bipartite permutation graphs
zbMATH Keywords: unit interval graphs
zbMATH Keywords: fixed parameter tractability
MaRDI profile type: Publication
full work available at URL: s00026-011-0117-2
OpenAlex ID: W2153230366
cites work: NP-completeness results for some problems on subclasses of bipartite and chordal graphs
cites work: Q4667625
cites work: The strong perfect graph theorem
cites work: Approximation algorithms for NP-complete problems on planar graphs
cites work: Q5463359
cites work: Clique-width for 4-vertex forbidden subgraphs
cites work: SIMPLE MAX-CUT for unit interval graphs and graphs with few \(P4\)s
cites work: A short proof that `proper = unit'
cites work: Jump number maximization for proper interval graphs and series-parallel graphs
cites work: Proper interval graphs and the guard problem
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: Decompositions for the edge colouring of reduced indifference graphs.
cites work: Diameter and treewidth in minor-closed graph families, revisited
cites work: Q5315023
cites work: Diameter and treewidth in minor-closed graph families
cites work: Clique-width minimization is NP-hard
cites work: On semi-\(P_ 4\)-sparse graphs
cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
cites work: Local tree-width, excluded minors, and approximation algorithms
cites work: Difference graphs
cites work: A Fully dynamic algorithm for recognizing and representing proper interval graphs
cites work: An interval graph is a comparability graph
cites work: Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
cites work: Bandwidth of chain graphs
cites work: Edge dominating set and colorings on graphs with fixed clique-width
cites work: On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree
cites work: Chordal bipartite graphs of bounded tree- and clique-width
cites work: Q3568753
cites work: THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES
cites work: ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P4'S
cites work: Precoloring extension on unit interval graphs
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Q5588432
cites work: Graph minors. V. Excluding a planar graph
cites work: Bipartite permutation graphs
cites work: Optimal path cover problem on block graphs and bipartite permutation graphs
DOI: 10.1007/S00026-011-0117-2
description: scientific article; zbMATH DE number 5999803