Topological Drawings of Complete Bipartite Graphs
From MaRDI portal
Publication:2961537
DOI10.1007/978-3-319-50106-2_34zbMath1417.68148arXiv1608.08324MaRDI QIDQ2961537
Publication date: 21 February 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.08324
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Cites Work
- Unnamed Item
- Simple realizability of complete abstract topological graphs in P
- How many ways can one draw a graph?
- Zarankiewicz's conjecture is finite for each fixed \(m\)
- The 2-page crossing number of \(K_{n}\)
- Simple Realizability of Complete Abstract Topological Graphs Simplified
- Topological Drawings of Complete Bipartite Graphs
- Noncrossing Subgraphs in Topological Layouts
- On the Number of Crossings in a Complete Graph
- On a problem of P. Turan concerning graphs