The following pages link to (Q4165164):
Displaying 50 items.
- Strong cliques and equistability of EPT graphs (Q260014) (← links)
- Graphs with induced-saturation number zero (Q276201) (← links)
- An \(O(n^3)\) time algorithm for recognizing threshold dimension 2 graphs (Q293369) (← links)
- Split graphs and Nordhaus-Gaddum graphs (Q297938) (← links)
- Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs (Q324752) (← links)
- On equistable, split, CIS, and related classes of graphs (Q344829) (← links)
- On recognition of threshold tolerance graphs and their complements (Q344853) (← links)
- \(H\)-product of graphs, \(H\)-threshold graphs and threshold-width of graphs (Q389453) (← links)
- Random threshold digraphs (Q405260) (← links)
- On the spectrum of threshold graphs (Q410640) (← links)
- Astral graphs (threshold graphs), scale-free graphs and related algorithmic questions (Q414467) (← links)
- A note on chromatic properties of threshold graphs (Q418900) (← links)
- Unit and single point interval graphs (Q427904) (← links)
- On 2-switches and isomorphism classes (Q442300) (← links)
- Eigenvalues and energy in threshold graphs (Q471959) (← links)
- Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs (Q477326) (← links)
- The Laplacian energy of threshold graphs and majorization (Q486231) (← links)
- Non-minimal degree-sequence-forcing triples (Q497308) (← links)
- The Dilworth number of auto-chordal bipartite graphs (Q497341) (← links)
- Efficient computation of the characteristic polynomial of a threshold graph (Q507427) (← links)
- On bounds for the index of double nested graphs (Q550625) (← links)
- The polytope of degree sequences (Q584289) (← links)
- The hardness of approximating the boxicity, cubicity and threshold dimension of a graph (Q602742) (← links)
- Recognizing strict 2-threshold graphs in O(m) time (Q673666) (← links)
- Monotone clutters (Q688257) (← links)
- Bipartite bithreshold graphs (Q688258) (← links)
- Some notes on the threshold graphs (Q708365) (← links)
- The induced separation dimension of a graph (Q722529) (← links)
- On random trees obtained from permutation graphs (Q738839) (← links)
- Counting and enumerating independent sets with applications to combinatorial optimization problems (Q784784) (← links)
- A class of threshold and domishold graphs: Equistable and equidominating graphs (Q795059) (← links)
- Permutations représentatives d'un graphe à seuil (Q795850) (← links)
- Degree sequences of matrogenic graphs (Q797597) (← links)
- Once more on matrogenic graphs (Q797598) (← links)
- The threshold order of a Boolean function (Q805595) (← links)
- Vicinal orders of trees (Q810522) (← links)
- Characterizations for co-graphs defined by restricted NLC-width or clique-width operations (Q819817) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- Minimum edge ranking spanning trees of split graphs (Q860397) (← links)
- \(\lambda\)-coloring matrogenic graphs (Q860405) (← links)
- Laplacian integral graphs in \(S(a, b)\) (Q876315) (← links)
- Completely separable graphs (Q908944) (← links)
- Pseudodomishold graphs (Q912871) (← links)
- On shift stable hypergraphs (Q923104) (← links)
- Unoriented Laplacian maximizing graphs are degree maximal (Q932145) (← links)
- NP-completeness results for some problems on subclasses of bipartite and chordal graphs (Q995581) (← links)
- Cubicity of threshold graphs (Q1025516) (← links)
- Note on upper bound graphs and forbidden subposets (Q1025563) (← links)
- Probe threshold and probe trivially perfect graphs (Q1034600) (← links)
- Threshold hypergraphs (Q1057879) (← links)
