Codi QR

Cubic planar graphs that cannot be drawn on few lines

For every integer $\ell$, we construct a cubic 3-vertex-connected planar bipartite graph $G$ with $O(\ell^3)$ vertices such that there is no planar straight-line drawing of $G$ whose vertices all lie on $\ell$ lines. This strengthens previous results on graphs that cannot be drawn on few lines, whic...

Descripció completa

Guardat en:
Dades bibliogràfiques
Autor principal: David Eppstein
Format: Artigo
Idioma:Inglês
Publicat: Carleton University 2021-12-01
Col·lecció:Journal of Computational Geometry
Accés en línia:https://jocg.org/index.php/jocg/article/view/3250
Etiquetes: Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!