Pages that link to "Item:Q3936783"
From MaRDI portal
The following pages link to Sufficient Conditions for Graphs to Have Threshold Number 2 (Q3936783):
Displayed 14 items.
- An \(O(n^ 3)\) recognition algorithm for bithreshold graphs (Q676270) (← links)
- Bipartite bithreshold graphs (Q688258) (← links)
- The relationship between the threshold dimension of split graphs and various dimensional parameters (Q803177) (← links)
- Strict 2-threshold graphs (Q1111574) (← links)
- Split dimension of graphs (Q1176734) (← links)
- Some complexity results about threshold graphs (Q1327235) (← links)
- Split graphs (Q1873776) (← links)
- Recognizing simple-triangle graphs by restricted 2-chain subgraph cover (Q2181225) (← links)
- Threshold Dimension of Graphs (Q3204506) (← links)
- The Complexity of the Partial Order Dimension Problem (Q3663349) (← links)
- The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial (Q5499731) (← links)
- Dominating cliques in graphs (Q5896554) (← links)
- Dominating cliques in graphs (Q5925264) (← links)
- The lexicographic method for the threshold cover problem (Q5925705) (← links)