Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
type: Item
instance of: scholarly article
title: Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
zbMATH Open document ID: 1084.05056
author: Andreas Brandstädt
author: Raffaele Mosca
author: Hoàng-Oanh Le
published in: Discrete Applied Mathematics
publication date: 2005-02-22T00:00:00Z
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 2136944
MaRDI profile type: Publication
full work available at URL: j.dam.2004.01.014
OpenAlex ID: W2040593601
cites work: Distance-hereditary graphs
cites work: The Pathwidth and Treewidth of Cographs
cites work: Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition
cites work: Graph Classes: A Survey
cites work: Q4508369
cites work: Complement reducible graphs
cites work: Q3676177
cites work: A Linear Recognition Algorithm for Cographs
cites work: Q4448749
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: Q4954442
cites work: Efficient and practical algorithms for sequential modular decomposition
cites work: Q3328583
cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
cites work: Completely separable graphs
cites work: A characterization of ptolemaic graphs
cites work: ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P4'S
cites work: Modular decomposition and transitive orientation
cites work: Q3683903
cites work: Algorithmic Aspects of Vertex Elimination on Graphs
cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
cites work: The Complexity of the Partial Order Dimension Problem
DOI: 10.1016/J.DAM.2004.01.014
Recommended article: GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
Recommended article: A BOUND FOR THE CHROMATIC NUMBER OF (, GEM)-FREE GRAPHS
Recommended article: Bounding the Clique-Width of H-free Chordal Graphs
Recommended article: Bounding the Clique‐Width of H‐Free Chordal Graphs
Recommended article: On the structure of (\(P_{5}\),\,gem)-free graphs
Recommended article: Stable set and clique polytopes of \((P_{5},\,\mathrm{gem})\)-free graphs
Recommended article: Chordal bipartite graphs of bounded tree- and clique-width
Recommended article: On algorithms for (\(P_5\), gem)-free graphs
Recommended article: A refinement on the structure of vertex-critical \((P_5, \mathrm{gem})\)-free graphs
Recommended article: Q5000997
description: scientific article; zbMATH DE number 2136944