Bounding Clique-Width via Perfect Graphs
type: Item
instance of: scholarly article
title: Bounding Clique-Width via Perfect Graphs
zbMATH Open document ID: 1425.05117
DOI: 10.1007/978-3-319-15579-1_53
author: Konrad Dabrowski
author: Shenwei Huang
author: Daniël Paulusma
published in: Language and Automata Theory and Applications
publication date: 2016-04-08T00:00:00Z
full work available at URL: 14239.pdf
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C17
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 6566816
zbMATH Keywords: clique-width
zbMATH Keywords: forbidden induced subgraphs
zbMATH Keywords: graph class
MaRDI profile type: Publication
OpenAlex ID: W2963554170
cites work: Q4425939
cites work: Graph classes with and without powers of bounded clique-width
cites work: Clique-width for 4-vertex forbidden subgraphs
cites work: Q5387674
cites work: On the structure of (\(P_{5}\),\,gem)-free graphs
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: Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time.
cites work: On variations of \(P_{4}\)-sparse graphs
cites work: The strong perfect graph theorem
cites work: On the Relationship Between Clique-Width and Treewidth
cites work: Clique-width and edge contraction
cites work: Linear time solvable optimization problems on graphs of bounded clique-width
cites work: Colouring of graphs with Ramsey-type forbidden subgraphs
cites work: Colouring vertices of triangle-free graphs without forests
cites work: Classifying the Clique-Width of H-Free Bipartite Graphs
cites work: Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs
cites work: Clique-Width is NP-Complete
cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
cites work: Line graphs of bounded clique-width
cites work: Q4489221
cites work: Recent developments on graphs of bounded clique-width
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: Q5487903
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: Approximating rank-width and clique-width quickly
cites work: Approximating clique-width and branch-width
cites work: MSOL partitioning problems on graphs of bounded treewidth and clique-width
description: scientific article