Crossings in Grid Drawings

Electronic Journal Of Combinatorics

Vida Dujmović¹ 

关键词: graph drawing;    grid drawing;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

We prove tight crossing number inequalities for geometric graphs whose vertex sets are taken from a $d$-dimensional grid of volume $N$ and give applications of these inequalities to counting the number of crossing-free geometric graphs that can be drawn o

【 授权许可】

Others