Cargando…
Inserting One Edge into a Simple Drawing is Hard
A simple drawing D(G) of a graph G is one where each pair of edges share at most one point: either a common endpoint or a proper crossing. An edge e in the complement of G can be inserted into D(G) if there exists a simple drawing of [Formula: see text] extending D(G). As a result of Levi’s Enlargem...
| Autores principales: | , , , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer US
2022
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9984358/ https://www.ncbi.nlm.nih.gov/pubmed/36883118 http://dx.doi.org/10.1007/s00454-022-00394-9 |