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.
Recommendations
Cites work
- Bipartite bithreshold graphs
- Bithreshold Graphs
- Four classes of perfectly orderable graphs
- scientific article; zbMATH DE number 3849276 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3598234 (Why is no real title available?)
- On the notion of balance of a signed graph
- Some properties of 2-threshold graphs
- Sufficient Conditions for Graphs to Have Threshold Number 2
- The Complexity of the Partial Order Dimension Problem
Cited in
(10)- Probe threshold and probe trivially perfect graphs
- Representations of graphs and networks (coding, layouts and embeddings)
- Split graphs
- Bithreshold graphs
- Some properties of 2-threshold graphs
- scientific article; zbMATH DE number 7378386 (Why is no real title available?)
- scientific article; zbMATH DE number 2218519 (Why is no real title available?)
- The lexicographic method for the threshold cover problem
- Recognizing strict 2-threshold graphs in O(m) time
- Bipartite bithreshold graphs
This page was built for publication: Strict 2-threshold graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111574)
