String graphs of k-bend paths on a grid
From MaRDI portal
Publication:2840697
DOI10.1016/j.endm.2011.05.025zbMath1268.05134MaRDI QIDQ2840697
Elad Cohen, Martin Charles Golumbic, Andrei Asinowski, Marina Lipshteyn, Vincent Limouzy, Michal Stern
Publication date: 23 July 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2011.05.025
graph coloring; planar graphs; chordal graphs; triangle-free graphs; Helly property; string graphs; circle graphs; grid intersection graphs
05C75: Structural characterization of families of graphs
05C62: Graph representations (geometric and intersection representations, etc.)
Related Items
On the intersection graphs of orthogonal line segments in the plane: characterizations of some subclasses of chordal graphs, Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Grid intersection graphs and boxicity
- Characterizations of strongly chordal graphs
- String graphs. I: The number of critical nonstring graphs is infinite
- On grid intersection graphs
- Intersection graphs of curves in the plane
- A special planar satisfiability problem and a consequence of its NP- completeness
- Intersection graphs of segments
- Vertex Intersection Graphs of Paths on a Grid
- Faithful Representations of Graphs by Islands in the Extended Grid
- The Complexity of Coloring Circular Arcs and Chords
- Topology of Thin Film RC Circuits