On Sparse Maximal 2-Planar Graphs
| Autor: | Andreas Gleißner, Kathrin Hanauer, Franz J. Brandenburg, Christopher Auer |
|---|---|
| Rok vydání: | 2013 |
| Předmět: | |
| Zdroj: | Graph Drawing ISBN: 9783642367625 Graph Drawing |
| DOI: | 10.1007/978-3-642-36763-2_50 |
| Popis: | A simple undirected graph G = (V, E) is k-planar if it can be drawn in the plane such that each edge is crossed at most k times, incident edges do not cross, and a pair of edges must not cross twice. Such graphs have attracted many graph drawers, see [1] and the references given there. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|