The following pages link to Bithreshold Graphs (Q3701461):
Displayed 12 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)
- Probe threshold and probe trivially perfect graphs (Q1034600) (← links)
- On randomized stopping points and perfect graphs (Q1085176) (← links)
- Strict 2-threshold graphs (Q1111574) (← links)
- On dimensional properties of graphs (Q1121914) (← links)
- A branch-and-bound algorithm for the two-dimensional vector packing problem (Q1317086) (← links)
- Degree sequences and majorization (Q1322868) (← links)
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
- Lower bounds and algorithms for the 2-dimensional vector packing problem (Q5939229) (← links)
- Finding houses and holes in graphs (Q5941278) (← links)