On grid intersection graphs
From MaRDI portal
Publication:1174140
DOI10.1016/0012-365X(91)90069-EzbMath0739.05081WikidataQ29037948 ScholiaQ29037948MaRDI QIDQ1174140
Ilan Newman, Ran Ziv, Irith Ben-Arroyo Hartman
Publication date: 25 June 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
bipartite graphintersection graphplanar graphsgrid representationline incidence graphs of projective planes
Related Items
A special planar satisfiability problem and a consequence of its NP- completeness, Intersection dimensions of graph classes, On the intersection graphs of orthogonal line segments in the plane: characterizations of some subclasses of chordal graphs, A left-first search algorithm for planar graphs, Permuting matrices to avoid forbidden submatrices, Planar graphs have 1-string representations, Drawing Planar Graphs with Prescribed Face Areas, Drawings of planar graphs with few slopes and segments, Embedding ray intersection graphs and global curve simplification, Finding geometric representations of apex graphs is NP-hard, Ferrers dimension of grid intersection graphs, On orthogonal ray graphs, Vertex Contact Graphs of Paths on a Grid, Contact Representations of Planar Graphs: Extending a Partial Representation is Hard, \(B_0\)-VPG representation of AT-free outerplanar graphs, Good spanning trees in graph drawing, Finding geometric representations of apex graphs is \textsf{NP}-hard, B0-VPG Representation of AT-free Outerplanar Graphs, Recognizing geometric intersection graphs stabbed by a line, Bijections for Baxter families and related objects, On the complexity of recognizing Stick, BipHook and max point-tolerance graphs, On orthogonal ray trees, Not all planar graphs are in PURE-4-DIR, Stick graphs with length constraints, Intersection dimension and graph invariants, Chordal bipartite graphs with high boxicity, Recognizing Stick Graphs with and without Length Constraints, Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs, Packing \([1, \Delta \)-factors in graphs of small degree], Grid intersection graphs and boxicity, Optimal grid representations, Orthogonal segment stabbing, Subspace intersection graphs, The interval structure of \(( 0 , 1 )\)-matrices, Recognition and drawing of stick graphs, Planar bus graphs, The partial visibility representation extension problem, Posets and VPG graphs, Representing graphs as the intersection of cographs and threshold graphs, Proportional Contact Representations of Planar Graphs, Interval bigraphs are unit grid intersection graphs, String graphs of k-bend paths on a grid, Characterization of \(\mathrm{B}_0\)-VPG cocomparability graphs and a 2D visualization of their posets, Minimum Cell Connection in Line Segment Arrangements, Characterization and a 2D Visualization of B$$_{0}$$-VPG Cocomparability Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- The interval number of a planar graph: Three intervals suffice
- Representing a planar graph by vertical lines joining different levels
- Interval representations of planar graphs
- Intersection graphs of curves in the plane
- Matrix characterizations of circular-arc graphs
- Über die Existenz von Inzidenzstrukturen mit Regularitätsbedingungen
- Representation of a finite graph by a set of intervals on the real line
