Bad drawings of small complete graphs
From MaRDI portal
Publication:5206933
zbMath1429.05147arXiv1903.06292MaRDI QIDQ5206933
Emily Groves, Grant Cairns, Yuri Nikolayevsky
Publication date: 19 December 2019
Full work available at URL: https://arxiv.org/abs/1903.06292
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simple realizability of complete abstract topological graphs in P
- Configuration spaces of colored graphs.
- Obstructions to the imbedding of a complex in a euclidean space. I: The first obstruction
- A one-dimensional Whitney trick and Kuratowski's graph planarity criterion
- A polynomial-time algorithm to find a linkless embedding of a graph
- Generalized thrackle drawings of non-bipartite graphs
- Topology of configuration space of two particles on a graph. I.
- A note on the parity of the number of crossings of a graph
- On approximability by embeddings of cycles in the plane.
- Decidability of string graphs
- A course in topological combinatorics
- Algebraic characterizations of outerplanar and planar graphs
- A Parity Theorem for Drawings of Complete and Complete Bipartite Graphs
- Points Multiples D'Une Application et Produit Cyclique Reduit
- Noncrossing Subgraphs in Topological Layouts
- The Fundamental Group of Certain Deleted Product Spaces
- Crossing Numbers of Graphs
- Über wesentlich unplättbare Kurven im dreidimensionalen Raume
- Hanani-Tutte and Related Results
- Homology of Deleted Products in Dimension One
- Toward a theory of crossing numbers
- Some Examples Relating the Deleted Product to Imbeddability
This page was built for publication: Bad drawings of small complete graphs
