Distinct distances in graph drawings

zbMath1179.05075arXiv0804.3690MaRDI QIDQ1010836

David R. Wood, Pat Morin, Paz Carmi, Vida Dujmović

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0804.3690

zbMATH Keywords

distance numberstraight line drawings of graphs in the plane

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (9)

Drawing outerplanar graphs using thirteen edge lengths ⋮ Crossings in grid drawings ⋮ Drawing outerplanar graphs using three edge lengths ⋮ Products of unit distance graphs ⋮ Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs ⋮ On dispersable book embeddings ⋮ Degenerate drawing of outerplanar graphs with two edge lengths ⋮ On tree-partition-width ⋮ The plane-width of graphs

This page was built for publication: Distinct distances in graph drawings