The following pages link to Tolerance graphs (Q798675):
Displaying 18 items.
- Recognizing simple-triangle graphs by restricted 2-chain subgraph cover (Q2181225) (← links)
- A recognition algorithm for simple-triangle graphs (Q2185743) (← links)
- On strict (outer-)confluent graphs (Q2206846) (← links)
- An intersection model for multitolerance graphs: efficient algorithms and hierarchy (Q2249739) (← links)
- A characterization of triangle-free tolerance graphs (Q2489942) (← links)
- Query-competitive sorting with uncertainty (Q2663045) (← links)
- New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs (Q2820855) (← links)
- Recognizing Threshold Tolerance Graphs in $$O(n^2)$$ Time (Q2945191) (← links)
- Pairwise Compatibility Graphs: A Survey (Q3186100) (← links)
- Linear time algorithms for dominating pairs in asteroidal triple-free graphs (Q4645186) (← links)
- On the perfect orderability of unions of two graphs (Q4944684) (← links)
- A survey on pairwise compatibility graphs (Q5012383) (← links)
- Characterization and a 2D Visualization of B$$_{0}$$-VPG Cocomparability Graphs (Q5014117) (← links)
- Computing a dominating pair in an asteroidal triple-free graph in linear time (Q5057448) (← links)
- On the <i>L</i>(<i>h</i>, <i>k</i>)‐labeling of co‐comparability graphs and circular‐arc graphs (Q5191125) (← links)
- Efficient Local Representations of Graphs (Q5506777) (← links)
- Domination graphs: Examples and counterexamples (Q5936465) (← links)
- Asteroidal triples of moplexes (Q5939228) (← links)
