Strict 2-threshold graphs (Q1111574)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Strict 2-threshold graphs |
scientific article; zbMATH DE number 4075127
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strict 2-threshold graphs |
scientific article; zbMATH DE number 4075127 |
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
0.8688760995864868
0 references
0.8661362528800964
0 references
0.8363189697265625
0 references
