Bi-complement reducible graphs (Q1356114): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1006/aama.1996.0519 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2042657610 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3686738 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3907592 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3899969 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Classes of bipartite graphs related to chordal graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complement reducible graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Linear Recognition Algorithm for Cographs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4954442 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Operational Statistics. I. Basic Concepts / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5202222 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3663338 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear time optimization algorithms for \(P_ 4\)-sparse graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3795708 / rank | |||
Normal rank |
Latest revision as of 13:04, 27 May 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