Bi-complement reducible graphs (Q1356114): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q585164 |
||
| Property / reviewed by | |||
| Property / reviewed by: Bal Kishan Dass / rank | |||
Revision as of 10:57, 17 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bi-complement reducible graphs |
scientific article |
Statements
Bi-complement reducible graphs (English)
0 references
4 June 1997
0 references
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.
0 references
complement reducible graphs
0 references
bi-complement reducible graphs
0 references
bi-cographs
0 references
