Monotonic representations of outerplanar graphs as edge intersection graphs of paths on a grid
E Çela, E Gaar - arXiv preprint arXiv:1908.01981, 2019 - arxiv.org
In a representation of a graph $ G $ as an edge intersection graph of paths on a grid (EPG)
every vertex of $ G $ is represented by a path on a grid and two paths share a grid edge iff …
every vertex of $ G $ is represented by a path on a grid and two paths share a grid edge iff …
[HTML][HTML] Hardness and approximation for L-EPG and B1-EPG graphs
D Epstein, MC Golumbic, A Lahiri… - Discrete Applied …, 2020 - Elsevier
The edge intersection graphs of paths on a grid (or EPG graphs) are graphs whose vertices
can be represented as simple paths on a rectangular grid such that two vertices are adjacent …
can be represented as simple paths on a rectangular grid such that two vertices are adjacent …
Arrangement Graphs and Intersection Graphs of Curves
U kant Sahoo - 2022 - library.isical.ac.in
An arrangement of a set of non-self-intersecting curves is their embedding in the Euclidean
plane such that at each intersection point the curves involved cross each other …
plane such that at each intersection point the curves involved cross each other …
Edge Intersection Graphs of Paths on a Grid
MC Golumbic, G Morgenstern - 50 years of Combinatorics, Graph …, 2019 - taylorfrancis.com
A graph G is an edge intersection graph of paths on a grid (or EPG graph) if its vertices can
be represented as simple paths on a rectangular grid, such that two vertices are adjacent in …
be represented as simple paths on a rectangular grid, such that two vertices are adjacent in …
On Some Subclasses of Split -EPG Graphs
In this paper, we are interested in edge intersection graphs of paths in a grid, such that each
path has at most one bend. These graphs were introduced in 14 and they are called B_1 B 1 …
path has at most one bend. These graphs were introduced in 14 and they are called B_1 B 1 …
[HTML][HTML] On k-bend and monotonic ℓ-bend edge intersection graphs of paths on a grid
E Çela, E Gaar - Discrete Applied Mathematics, 2023 - Elsevier
If a graph G can be represented by means of paths on a grid, such that each vertex of G
corresponds to one path on the grid and two vertices of G are adjacent if and only if the …
corresponds to one path on the grid and two vertices of G are adjacent if and only if the …