The following pages link to On grid intersection graphs (Q1174140):
Displaying 40 items.
- Ferrers dimension of grid intersection graphs (Q344841) (← links)
- On orthogonal ray graphs (Q602682) (← links)
- Chordal bipartite graphs with high boxicity (Q659714) (← links)
- Grid intersection graphs and boxicity (Q685652) (← links)
- Orthogonal segment stabbing (Q705557) (← links)
- Subspace intersection graphs (Q712273) (← links)
- Planar bus graphs (Q724233) (← links)
- The partial visibility representation extension problem (Q724235) (← links)
- Good spanning trees in graph drawing (Q897943) (← links)
- On orthogonal ray trees (Q908312) (← links)
- Interval bigraphs are unit grid intersection graphs (Q1024491) (← links)
- A special planar satisfiability problem and a consequence of its NP- completeness (Q1331895) (← links)
- Intersection dimensions of graph classes (Q1334942) (← links)
- A left-first search algorithm for planar graphs (Q1892422) (← links)
- Permuting matrices to avoid forbidden submatrices (Q1894366) (← links)
- The interval structure of \(( 0 , 1 )\)-matrices (Q2026313) (← links)
- Representing graphs as the intersection of cographs and threshold graphs (Q2040010) (← links)
- Characterization of \(\mathrm{B}_0\)-VPG cocomparability graphs and a 2D visualization of their posets (Q2088073) (← links)
- Embedding ray intersection graphs and global curve simplification (Q2151460) (← links)
- Finding geometric representations of apex graphs is NP-hard (Q2154093) (← links)
- Stick graphs with length constraints (Q2206824) (← links)
- Intersection dimension and graph invariants (Q2214313) (← links)
- On the intersection graphs of orthogonal line segments in the plane: characterizations of some subclasses of chordal graphs (Q2376078) (← links)
- Planar graphs have 1-string representations (Q2380780) (← links)
- Drawings of planar graphs with few slopes and segments (Q2385699) (← links)
- Bijections for Baxter families and related objects (Q2431261) (← links)
- Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs (Q2457021) (← links)
- Packing \([1, \Delta ]\)-factors in graphs of small degree (Q2460103) (← links)
- On the complexity of recognizing Stick, BipHook and max point-tolerance graphs (Q2693628) (← links)
- String graphs of k-bend paths on a grid (Q2840697) (← links)
- Vertex Contact Graphs of Paths on a Grid (Q2945180) (← links)
- Contact Representations of Planar Graphs: Extending a Partial Representation is Hard (Q2945185) (← links)
- Minimum Cell Connection in Line Segment Arrangements (Q3132917) (← links)
- Drawing Planar Graphs with Prescribed Face Areas (Q3181055) (← links)
- Optimal grid representations (Q4651928) (← links)
- Not all planar graphs are in PURE-4-DIR (Q5119380) (← links)
- Recognizing Stick Graphs with and without Length Constraints (Q5141646) (← links)
- Finding geometric representations of apex graphs is \textsf{NP}-hard (Q6175518) (← links)
- B0-VPG Representation of AT-free Outerplanar Graphs (Q6202310) (← links)
- Recognizing geometric intersection graphs stabbed by a line (Q6204544) (← links)
