Bi-complement reducible graphs
type: Item
instance of: scholarly article
title: Bi-complement reducible graphs
zbMATH Open document ID: 0872.05031
author: Vassilis Giakoumakis
author: Jean-Marie Vanherpe
published in: Advances in Applied Mathematics
publication date: 1997-06-04T00:00:00Z
review text: A new family of bipartite graphs which is the bipartite analogue of the class of `complement reducible' graphs or `cographs' has been introduced. The aim of the paper is to show that there exists an equivalent definition of bi-cographs by three forbidden configurations. A tree representation of this class of graphs has also been proposed.
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 1016984
zbMATH Keywords: complement reducible graphs
zbMATH Keywords: bi-complement reducible graphs
zbMATH Keywords: bi-cographs
reviewed by: Bai Kishan Dass
MaRDI profile type: Publication
full work available at URL: aama.1996.0519
OpenAlex ID: W2042657610
cites work: Q3686738
cites work: Q3907592
cites work: Q3899969
cites work: Classes of bipartite graphs related to chordal graphs
cites work: Complement reducible graphs
cites work: A Linear Recognition Algorithm for Cographs
cites work: Q4954442
cites work: Operational Statistics. I. Basic Concepts
cites work: Q5202222
cites work: Q3663338
cites work: Linear time optimization algorithms for \(P_ 4\)-sparse graphs
cites work: Q3795708
DOI: 10.1006/AAMA.1996.0519
description: scientific article; zbMATH DE number 1016984