Pages that link to "Item:Q5172758"

The following pages link to Every planar graph is the intersection graph of segments in the plane (Q5172758):

Displaying 35 items.

• Intersection graphs of L-shapes and segments in the plane (Q277615) (← links)
• The clique problem in ray intersection graphs (Q377488) (← links)
• Segment representation of a subclass of co-planar graphs (Q418892) (← links)
• An algorithm for the maximum weight independent set problem on outerstring graphs (Q680149) (← links)
• Subspace intersection graphs (Q712273) (← links)
• On orthogonal ray trees (Q908312) (← links)
• Finding geometric representations of apex graphs is NP-hard (Q2154093) (← links)
• Parikh word representability of bipartite permutation graphs (Q2185746) (← links)
• Stick graphs with length constraints (Q2206824) (← links)
• The interval number of a planar graph is at most three (Q2221918) (← links)
• Counting polygon triangulations is hard (Q2223620) (← links)
• On the speed of algebraically defined graph classes (Q2227284) (← links)
• Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363) (← links)
• On grounded \(\llcorner\)-graphs and their relatives (Q2315438) (← links)
• Segment representations with small resolution (Q2338214) (← links)
• Planar graphs have 1-string representations (Q2380780) (← links)
• Order-Preserving 1-String Representations of Planar Graphs (Q2971141) (← links)
• Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q3452835) (← links)
• Intersection Graphs of Rays and Grounded Segments (Q4585058) (← links)
• Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q4593248) (← links)
• (Q5088963) (← links)
• On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance (Q5115824) (← links)
• (Q5116474) (← links)
• Not all planar graphs are in PURE-4-DIR (Q5119380) (← links)
• Recognizing Stick Graphs with and without Length Constraints (Q5141646) (← links)
• Efficient Local Representations of Graphs (Q5506777) (← links)
• Refining the hierarchies of classes of geometric intersection graphs (Q5892293) (← links)
• Recognition and drawing of stick graphs (Q5915944) (← links)
• Optimality program in segment and string graphs (Q5920196) (← links)
• Finding geometric representations of apex graphs is \textsf{NP}-hard (Q6175518) (← links)
• Coloring triangle-free L-graphs with \(O (\log \log n)\) colors (Q6181998) (← links)
• B0-VPG Representation of AT-free Outerplanar Graphs (Q6202310) (← links)
• Exactly hittable interval graphs (Q6599815) (← links)
• Coloring triangle-free L-graphs with \(O(\log\log n)\) colors (Q6621266) (← links)
• Graphs of intersections of closed polygonal chains (Q6669632) (← links)