The following pages link to (Q3322150):
Displayed 22 items.
- On a problem concerning tolerance graphs (Q689957) (← links)
- Tolerance graphs (Q798675) (← links)
- Interval graphs and related topics (Q1060229) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- Stability number and chromatic number of tolerance graphs (Q1186162) (← links)
- Bipartite tolerance orders (Q1336645) (← links)
- A class of graphs each tolerance graph of which is a bounded one (Q1341250) (← links)
- Proper and unit bitolerance orders and graphs (Q1381846) (← links)
- Dot product representations of graphs (Q1381853) (← 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)
- Bandwidth and density for block graphs (Q1584358) (← links)
- NeST graphs (Q1613397) (← links)
- Constant tolerance intersection graphs of subtrees of a tree (Q1764901) (← links)
- Neighborhood subtree tolerance graphs (Q1801665) (← links)
- Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs (Q1827836) (← 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)
- Domination graphs: Examples and counterexamples (Q5936465) (← links)