Using block designs in crossing number bounds
The crossing number CR(𝐺) of a graph 𝐺=(𝑉,𝐸) is the smallest number of edge crossings over all drawings of 𝐺 in the plane. For any 𝑘≥1 , the 𝑘 ‐planar crossing number of 𝐺,CR𝑘(𝐺) , is defined as the minimum of CR(𝐺1)+CR(𝐺2)+⋯+CR(𝐺𝑘) over all graphs 𝐺1,𝐺2,…,𝐺𝑘 with ∪𝑘𝑖=1𝐺𝑖=𝐺 . Pach et a...
| Main Authors: | , , , , , , , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Wiley
2019
|