\(B_0\)-VPG representation of AT-free outerplanar graphs
From MaRDI portal
Publication:6102269
DOI10.1007/978-3-030-95018-7_9arXiv2209.08269MaRDI QIDQ6102269
Deepak Rajendraprasad, Sreejith K. Pallathumadam, Sparsh Jain
Publication date: 8 May 2023
Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2209.08269
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- VPG and EPG bend-numbers of Halin graphs
- Max point-tolerance graphs
- String graphs. II: Recognizing string graphs is NP-hard
- A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments
- On grid intersection graphs
- Intersection graphs of segments
- Bounds on the bend number of split and cocomparability graphs
- On the intersection graphs of orthogonal line segments in the plane: characterizations of some subclasses of chordal graphs
- Vertex intersection graphs of paths on a grid: characterization within block graphs
- $1$-string $B_2$-VPG representation of planar graphs
- Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid
- Vertex Intersection Graphs of Paths on a Grid
- Triangle-Free Planar Graphs and Segment Intersection Graphs
- Planar Graphs as VPG-Graphs
- Characterization and a 2D Visualization of B$$_{0}$$-VPG Cocomparability Graphs
- Every planar graph is the intersection graph of segments in the plane
- Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill
- Recognizing string graphs in NP
- Posets and VPG graphs
This page was built for publication: \(B_0\)-VPG representation of AT-free outerplanar graphs
