Recognition of some perfectly orderable graph classes
type: Item
instance of: scholarly article
title: Recognition of some perfectly orderable graph classes
zbMATH Open document ID: 1019.68075
DOI: 10.1016/S0166-218X(02)00499-7
author: Elaine M. Eschen
author: Julie L. Johnson
author: Jeremy P. Spinrad
author: R. Sritharan
published in: Discrete Applied Mathematics
publication date: 2003-06-10T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 1925293
zbMATH Keywords: perfectly orderable graph
zbMATH Keywords: brittle graph
zbMATH Keywords: recognition algorithm
MaRDI profile type: Publication
cites work: Graph Classes: A Survey
cites work: Q3347930
cites work: On the \(P_ 4\)-structure of perfect graphs. III: Partner decompositions
cites work: Four classes of perfectly orderable graphs
cites work: Generalized neighbourhoods and a class of perfectly orderable graphs
cites work: Matrix multiplication via arithmetic progressions
cites work: Q4954442
cites work: Q5501779
cites work: On rigid circuit graphs
cites work: Incidence matrices and interval graphs
cites work: \(P_{4}\)-laden graphs: A new class of brittle graphs
cites work: Q3691742
cites work: Q4234100
cites work: Bipartable graphs
cites work: Bipolarizable graphs
cites work: On \(P_4\)-transversals of perfect graphs
cites work: On brittle graphs
cites work: A note on perfect orders
cites work: Some classes of perfectly orderable graphs
cites work: \(P_ 4\)-comparability graphs
cites work: Finding houses and holes in graphs
cites work: Q4542523
cites work: On the semi-perfect elimination
cites work: Modular decomposition and transitive orientation
cites work: On the complexity of recognizing perfectly orderable graphs
cites work: Q3683903
cites work: Weak bipolarizable graphs
cites work: Quasi-brittle graphs, a new class of perfectly orderable graphs
cites work: Welsh-Powell opposition graphs
cites work: A note on superbrittle graphs
cites work: Triangulated graphs and the elimination process
cites work: Algorithmic Aspects of Vertex Elimination on Graphs
cites work: Recognizing brittle graphs: Remarks on a paper of Hoàng and Khouzam
cites work: Q5501808
cites work: An upper bound for the chromatic number of a graph and its application to timetabling problems
description: scientific article; zbMATH DE number 1925293