A linear-time recognition algorithm for \(P_{4}\)-reducible graphs
type: Item
instance of: scholarly article
title: A linear-time recognition algorithm for \(P_{4}\)-reducible graphs
zbMATH Open document ID: 0873.68155
DOI: 10.1016/0304-3975(95)00016-P
author: Juan-Miguel Gracia
published in: Theoretical Computer Science
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 985378
zbMATH Keywords: \(P_ 4\)-reducible graphs
zbMATH Keywords: cographs
MaRDI profile type: Publication
cites work: Q3941433
cites work: Q3697033
cites work: Complement reducible graphs
cites work: A Linear Recognition Algorithm for Cographs
cites work: P4-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
cites work: Q3355252
cites work: On a class of posets and the corresponding comparability graphs
cites work: On a property of the class of n-colorable graphs
cites work: Dacey Graphs
cites work: Incremental modular decomposition
full work available at URL: 0304-3975(95)00016-p
OpenAlex ID: W2038893115
description: scientific article; zbMATH DE number 985378