Proper circular arc graphs as intersection graphs of paths on a grid
From MaRDI portal
Publication:2416437
DOI10.1016/j.dam.2019.02.010zbMath1411.05144arXiv1808.09344OpenAlexW2963393176WikidataQ128273533 ScholiaQ128273533MaRDI QIDQ2416437
María Pía Mazzoleni, Bernard Ries, Esther Galby
Publication date: 23 May 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.09344
Related Items (2)
Cites Work
- Unnamed Item
- VPG and EPG bend-numbers of Halin graphs
- On the bend-number of planar and outerplanar graphs
- Some properties of edge intersection graphs of single-bend paths on a grid
- Characterizations of cographs as intersection graphs of paths on a grid
- Restricted circular-arc graphs and clique cycles
- Edge-intersection graphs of grid paths: the bend-number
- Matrix characterizations of circular-arc graphs
- Structure theorems for some circular-arc graphs
- Some properties of edge intersection graphs of single bend paths on a grid
- Edge intersection graphs of single bend paths on a grid
- On Edge Intersection Graphs of Paths with 2 Bends
- Representation of a finite graph by a set of intervals on the real line
- Proper Helly Circular-Arc Graphs
- Topics in Intersection Graph Theory
- Edge-Intersection Graphs of k-Bend Paths in Grids
- On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
This page was built for publication: Proper circular arc graphs as intersection graphs of paths on a grid