Strict 2-threshold graphs (Q1111574): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Ralph G.Stanton / rank | |||
Property / reviewed by | |||
Property / reviewed by: Ralph G.Stanton / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4165164 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Four classes of perfectly orderable graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3328583 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bithreshold Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3318808 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some properties of 2-threshold graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bipartite bithreshold graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the notion of balance of a signed graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sufficient Conditions for Graphs to Have Threshold Number 2 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Complexity of the Partial Order Dimension Problem / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0166-218x(88)90048-0 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2092353941 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 12:13, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Strict 2-threshold graphs |
scientific article |
Statements
Strict 2-threshold graphs (English)
0 references
1988
0 references
A graph is a strict 2-threshold graph if its edge set can be partitioned into two threshold graphs \(T_ 1\) and \(T_ 2\) so that any triangle in G appears in either \(T_ 1\) or \(T_ 2\). The authors give a polynomial- time algorithm for determining when G is a strict 2-threshold graph.
0 references
triangles in graphs
0 references
2-threshold graph
0 references
edge set
0 references
algorithm
0 references