Saturated Drawings of Geometric Thickness k

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Bachmann, Patricia, Brötzner, Anna, Goetze, Miriam, Kindermann, Philipp, Pfretzschner, Matthias, Terziadis, Soeren
Formato: Preprint
Publicado: 2025
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866910859684478976
author Bachmann, Patricia
Brötzner, Anna
Goetze, Miriam
Kindermann, Philipp
Pfretzschner, Matthias
Terziadis, Soeren
author_facet Bachmann, Patricia
Brötzner, Anna
Goetze, Miriam
Kindermann, Philipp
Pfretzschner, Matthias
Terziadis, Soeren
contents We investigate saturated geometric drawings of graphs with geometric thickness $k$, where no edge can be added without increasing $k$. We establish lower and upper bounds on the number of edges in such drawings if the vertices lie in convex position. We also study the more restricted version where edges are precolored, and for $k=2$ the case for vertices in non-convex position.
format Preprint
id arxiv_https___arxiv_org_abs_2503_03577
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Saturated Drawings of Geometric Thickness k
Bachmann, Patricia
Brötzner, Anna
Goetze, Miriam
Kindermann, Philipp
Pfretzschner, Matthias
Terziadis, Soeren
Computational Geometry
We investigate saturated geometric drawings of graphs with geometric thickness $k$, where no edge can be added without increasing $k$. We establish lower and upper bounds on the number of edges in such drawings if the vertices lie in convex position. We also study the more restricted version where edges are precolored, and for $k=2$ the case for vertices in non-convex position.
title Saturated Drawings of Geometric Thickness k
topic Computational Geometry
url https://arxiv.org/abs/2503.03577