Weak bipolarizable graphs (Q1116961): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Topics on perfect graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3347930 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Four classes of perfectly orderable graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On rigid circuit graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3328583 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tolerance graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On brittle graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on superbrittle graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank | |||
Normal rank |
Latest revision as of 13:19, 19 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Weak bipolarizable graphs |
scientific article |
Statements
Weak bipolarizable graphs (English)
0 references
1989
0 references
We characterize a new class of perfectly orderable graphs and give a polynomial-time recognition algorithm together with linear-time optimization algorithms for this class of graphs.
0 references
perfectly orderable graphs
0 references
recognition algorithm
0 references