Strict 2-threshold graphs (Q1111574): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q587392 |
||
| Property / reviewed by | |||
| Property / reviewed by: Ralph G.Stanton / rank | |||
Revision as of 09:17, 16 February 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
