\(P_ 4\)-comparability graphs
type: Item
instance of: scholarly article
title: \(P_ 4\)-comparability graphs
zbMATH Open document ID: 0675.05067
DOI: 10.1016/0012-365X(89)90209-4
published in: Discrete Mathematics
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 06A06
zbMATH DE Number: 4105022
zbMATH Keywords: clique problem
zbMATH Keywords: perfectly orderable graphs
zbMATH Keywords: perfect graphs
zbMATH Keywords: comparability graphs
zbMATH Keywords: \(P_ 4\)-comparability graphs
zbMATH Keywords: recognition algorithm
zbMATH Keywords: colouring problems
author: Chính T. Hoàng
author: Bruce Reed
MaRDI profile type: Publication
cites work: Q3347930
cites work: Decomposition of Directed Graphs
cites work: Q3291037
cites work: A Characterization of Comparability Graphs and of Interval Graphs
cites work: Q3328583
cites work: Bipolarizable graphs
cites work: Some classes of perfectly orderable graphs
full work available at URL: 0012-365x(89)90209-4
OpenAlex ID: W1963780543
Wikidata QID: Q126551949
description: scientific article; zbMATH DE number 4105022