Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method
From MaRDI portal
Publication:3608305
Recommendations
Cites work
- A note on Halton's conjecture
- A successful concept for measuring non-planarity of graphs: The crossing number.
- Biplanar graphs: A survey
- Crossing-Free Subgraphs
- Determining the thickness of graphs is NP-hard
- Genus g Graphs Have Pagenumber O(√g)
- On the thickness and arboricity of a graph
- On the thickness of graphs of given degree
- On VLSI layouts of the star graph and related networks
- Planarizing graphs---a survey and annotated bibliography
- The thickness of graphs: A survey
Cited in
(8)- Note on \(k\)-planar crossing numbers
- On the \(k\)-planar local crossing number
- A short proof of the non-biplanarity of \(K_9\)
- On the 2-colored crossing number
- Book drawings of complete bipartite graphs
- scientific article; zbMATH DE number 2145247 (Why is no real title available?)
- A short proof of the non-biplanarity of $K_9$
- On the biplanar and k-planar crossing numbers
This page was built for publication: Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608305)