The following pages link to Threshold Dimension of Graphs (Q3204506):
Displaying 14 items.
- An \(O(n^3)\) time algorithm for recognizing threshold dimension 2 graphs (Q293369) (← links)
- 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)
- The induced matching and chain subgraph cover problems for convex bipartite graphs (Q995582) (← links)
- Cubicity of threshold graphs (Q1025516) (← links)
- Multidimensional scaling and threshold graphs (Q1106142) (← links)
- On dimensional properties of graphs (Q1121914) (← links)
- A min-max property of chordal bipartite graphs with applications (Q1959718) (← links)
- Representing graphs as the intersection of cographs and threshold graphs (Q2040010) (← links)
- Double-threshold permutation graphs (Q2159387) (← links)
- Some results on multithreshold graphs (Q2175817) (← links)
- The lexicographic method for the threshold cover problem (Q5925705) (← links)
- Certifying fully dynamic algorithms for recognition and Hamiltonicity of threshold and chain graphs (Q6174822) (← links)