On the structure of (\(P_{5}\),\,gem)-free graphs
type: Item
instance of: scholarly article
title: On the structure of (\(P_{5}\),\,gem)-free graphs
zbMATH Open document ID: 1084.05048
author: Andreas Brandstädt
author: Dieter Kratsch
published in: Discrete Applied Mathematics
publication date: 2005-02-22T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 2136938
zbMATH Keywords: (\(P_5\), gem)-free graphs
zbMATH Keywords: Modules and homogeneous sets in graphs
zbMATH Keywords: Prime graphs
zbMATH Keywords: Modular decomposition
zbMATH Keywords: Clique width
MaRDI profile type: Publication
full work available at URL: j.dam.2004.01.009
OpenAlex ID: W1493930654
cites work: Graph Classes: A Survey
cites work: Complement reducible graphs
cites work: Q3676177
cites work: A Linear Recognition Algorithm for Cographs
cites work: Handle-rewriting hypergraph grammars
cites work: Linear time solvable optimization problems on graphs of bounded clique-width
cites work: Q4954442
cites work: Efficient and practical algorithms for sequential modular decomposition
cites work: Q3328583
cites work: Some classes of perfectly orderable graphs
cites work: Representation of a finite graph by a set of intervals on the real line
cites work: Modular decomposition and transitive orientation
cites work: Some results on maximum stable sets in certain \(P_{5}\)-free graphs
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.009
Recommended article: A refinement on the structure of vertex-critical \((P_5, \mathrm{gem})\)-free graphs
Recommended article: On algorithms for (\(P_5\), gem)-free graphs
Recommended article: On (\(P_{5}\), diamond)-free graphs
Recommended article: On a Class of P 5 -Free Graphs
Recommended article: A BOUND FOR THE CHROMATIC NUMBER OF (, GEM)-FREE GRAPHS
Recommended article: Stable set and clique polytopes of \((P_{5},\,\mathrm{gem})\)-free graphs
Recommended article: Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors
Recommended article: (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization.
Recommended article: A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs
Recommended article: Some results on \(k\)-critical \(P_5\)-free graphs
description: scientific article; zbMATH DE number 2136938