The following pages link to (Q4607888):
Displaying 20 items.
- CPG graphs: some structural and hardness results (Q827595) (← links)
- On contact graphs of paths on a grid (Q1725765) (← links)
- Topological inductive constructions for tight surface graphs (Q2084791) (← links)
- Characterization of \(\mathrm{B}_0\)-VPG cocomparability graphs and a 2D visualization of their posets (Q2088073) (← links)
- Unit disk representations of embedded trees, outerplanar and multi-legged graphs (Q2151453) (← links)
- Finding geometric representations of apex graphs is NP-hard (Q2154093) (← links)
- Characterising circular-arc contact \(B_0\)-VPG graphs (Q2192099) (← links)
- Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363) (← links)
- On grounded \(\llcorner\)-graphs and their relatives (Q2315438) (← links)
- Bounds on the bend number of split and cocomparability graphs (Q2322713) (← links)
- Segment representations with small resolution (Q2338214) (← links)
- Not all planar graphs are in PURE-4-DIR (Q5119380) (← links)
- Homothetic triangle representations of planar graphs (Q5240366) (← links)
- Shorter Labeling Schemes for Planar Graphs (Q5866447) (← links)
- Computing maximum independent set on outerstring graphs and their relatives (Q5918655) (← 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)
- Recognizing geometric intersection graphs stabbed by a line (Q6204544) (← links)
