The following pages link to Tolerance graphs (Q798675):
Displaying 50 items.
- A sufficient condition for boundedness of tolerance graphs (Q411864) (← links)
- First-fit coloring of bounded tolerance graphs (Q531602) (← links)
- A linear time algorithm to compute a dominating path in an AT-free graph (Q673002) (← links)
- On a problem concerning tolerance graphs (Q689957) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- Recognizing graphs without asteroidal triples (Q876727) (← links)
- On the intersection of tolerance and cocomparability graphs (Q896656) (← links)
- Exact leaf powers (Q982668) (← links)
- Treelike comparability graphs (Q1026130) (← links)
- Interval graphs and related topics (Q1060229) (← links)
- Bipartable graphs (Q1080439) (← links)
- On randomized stopping points and perfect graphs (Q1085176) (← links)
- Alternating orientation and alternating colouration of perfect graphs (Q1089007) (← links)
- Generalized neighbourhoods and a class of perfectly orderable graphs (Q1103648) (← links)
- Fuzzy intersection graphs (Q1107547) (← links)
- Trapezoid graphs and their coloring (Q1111577) (← links)
- Weak bipolarizable graphs (Q1116961) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Stability number and chromatic number of tolerance graphs (Q1186162) (← links)
- Graphs with special neighbourhood orderings of vertices (Q1309442) (← links)
- Bipartite tolerance orders (Q1336645) (← links)
- A class of graphs each tolerance graph of which is a bounded one (Q1341250) (← links)
- The \(p\)-intersection number of a complete bipartite graph and orthogonal double coverings of a clique (Q1343169) (← links)
- Proper and unit bitolerance orders and graphs (Q1381846) (← links)
- On \(k\)-weak orders: Recognition and a tolerance result (Q1381859) (← links)
- Cliques that are tolerance digraphs (Q1382269) (← links)
- Generalizations of semiorders: A review note (Q1384555) (← links)
- Triangulating multitolerance graphs (Q1392575) (← links)
- On linear and circular structure of (claw, net)-free graphs (Q1406025) (← links)
- Hereditary dominating pair graphs (Q1421473) (← links)
- Bandwidth and density for block graphs (Q1584358) (← links)
- NeST graphs (Q1613397) (← links)
- Intuitionistic fuzzy tolerance graphs with application (Q1677149) (← links)
- Fuzzy \(\phi\)-tolerance competition graphs (Q1701852) (← links)
- A new graph parameter to measure linearity (Q1708605) (← links)
- Towards a comprehensive theory of conflict-tolerance graphs (Q1759850) (← links)
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)
- Constant tolerance intersection graphs of subtrees of a tree (Q1764901) (← links)
- Neighborhood subtree tolerance graphs (Q1801665) (← links)
- On the semi-perfect elimination (Q1825204) (← links)
- Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs (Q1827836) (← links)
- AT-free graphs: Linear bounds for the oriented diameter (Q1827858) (← links)
- Chordal probe graphs (Q1887057) (← links)
- A note on tolerance graph recognition (Q1887065) (← links)
- Proper and unit tolerance graphs (Q1894354) (← links)
- Any complete preference structure without circuit admits an interval representation (Q1908002) (← links)
- Triangulating graphs without asteroidal triples (Q1917255) (← links)
- Characterization of \(\mathrm{B}_0\)-VPG cocomparability graphs and a 2D visualization of their posets (Q2088073) (← links)
- Double-threshold permutation graphs (Q2159387) (← links)
