The following pages link to Max point-tolerance graphs (Q344833):
Displaying 18 items.
- Grid intersection graphs and order dimension (Q722596) (← links)
- Generalized disk graphs (Q832849) (← links)
- Non-edge orientation and vertex ordering characterizations of some classes of bigraphs (Q1752498) (← links)
- Dominating set of rectangles intersecting a straight line (Q2025079) (← links)
- On dominating set of some subclasses of string graphs (Q2144448) (← links)
- Stick graphs with length constraints (Q2206824) (← links)
- On grounded \(\llcorner\)-graphs and their relatives (Q2315438) (← links)
- Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames (Q2331213) (← links)
- Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity (Q2340410) (← links)
- A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs (Q2423295) (← links)
- On the complexity of recognizing Stick, BipHook and max point-tolerance graphs (Q2693628) (← links)
- On central max-point-tolerance graphs (Q4956231) (← links)
- Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames (Q5005138) (← links)
- Recognizing Stick Graphs with and without Length Constraints (Q5141646) (← links)
- Coloring polygon visibility graphs and their generalizations (Q6038590) (← links)
- Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs (Q6064836) (← links)
- Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded (Q6142355) (← links)
- B0-VPG Representation of AT-free Outerplanar Graphs (Q6202310) (← links)
