The following pages link to (Q4828541):
Displaying 50 items.
- PTAS for densest \(k\)-subgraph in interval graphs (Q261389) (← links)
- On containment graphs of paths in a tree (Q324771) (← links)
- Max point-tolerance graphs (Q344833) (← links)
- A sufficient condition for boundedness of tolerance graphs (Q411864) (← links)
- The recognition of triangle graphs (Q441856) (← links)
- Counting independent sets in a tolerance graph (Q479039) (← links)
- First-fit coloring of bounded tolerance graphs (Q531602) (← links)
- Fractional weak discrepancy and split semiorders (Q531608) (← links)
- The \(t\)-discrepancy of a poset (Q602757) (← links)
- Adjacency matrices of probe interval graphs (Q608289) (← links)
- An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs (Q626964) (← links)
- A characterization of chain probe graphs (Q646709) (← links)
- On the complete width and edge clique cover problems (Q721937) (← links)
- The induced separation dimension of a graph (Q722529) (← links)
- Tolerance graphs (Q798675) (← links)
- \(\lambda\)-coloring matrogenic graphs (Q860405) (← links)
- On the intersection of tolerance and cocomparability graphs (Q896656) (← links)
- Forbidden substructure for interval digraphs/bigraphs (Q898169) (← links)
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers (Q968201) (← links)
- Exact leaf powers (Q982668) (← links)
- On the bi-enhancement of chordal-bipartite probe graphs (Q991750) (← links)
- Equivalences and the complete hierarchy of intersection graphs of paths in a tree (Q1003465) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. I (Q1003752) (← links)
- Two-colorable graph states with maximal Schmidt measure (Q1017249) (← links)
- Cubicity of threshold graphs (Q1025516) (← links)
- Intersection models of weakly chordal graphs (Q1026105) (← links)
- Stability number and chromatic number of tolerance graphs (Q1186162) (← links)
- NeST graphs (Q1613397) (← links)
- Homothetic polygons and beyond: maximal cliques in intersection graphs (Q1671346) (← links)
- Fuzzy \(\phi\)-tolerance competition graphs (Q1701852) (← links)
- Recent results on containment graphs of paths in a tree (Q1752490) (← links)
- Towards a comprehensive theory of conflict-tolerance graphs (Q1759850) (← links)
- Dyadic representations of graphs (Q1783614) (← links)
- A vertex ordering characterization of simple-triangle graphs (Q1800397) (← links)
- Chordal probe graphs (Q1887057) (← links)
- Double-threshold permutation graphs (Q2159387) (← links)
- Dimension of restricted classes of interval orders (Q2163840) (← links)
- Recognizing simple-triangle graphs by restricted 2-chain subgraph cover (Q2181225) (← links)
- Constant threshold intersection graphs of orthodox paths in trees (Q2184664) (← links)
- A recognition algorithm for simple-triangle graphs (Q2185743) (← links)
- An intersection model for multitolerance graphs: efficient algorithms and hierarchy (Q2249739) (← links)
- Tolerance orders of open and closed unit intervals (Q2314425) (← links)
- Interval orders with two interval lengths (Q2322869) (← links)
- Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2 (Q2374177) (← links)
- Helly EPT graphs on bounded degree trees: characterization and recognition (Q2404370) (← links)
- Intersection graphs of orthodox paths in trees (Q2413157) (← links)
- Characterizing interval graphs which are probe unit interval graphs (Q2416421) (← links)
- A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs (Q2423295) (← links)
- Recognition of probe proper interval graphs (Q2440119) (← links)
- Co-TT graphs and a characterization of split co-TT graphs (Q2448900) (← links)
