Fetching the paper…
Reading the bibliography…
We present a simplified exposition of some classical and modern results on graph drawings in the plane.
S. Avvakumov, R. Karasev. Envy-free division using mapping degree. arXiv:1907.11183
1907
Earlier work this paper cites.
1908
Earlier work this paper cites.
E. R. van Kampen , Komplexe in euklidischen Räumen, Abh. Math. Sem. Hamburg, 9 (1933) 72–78; Berichtigung dazu, 152–153. English translation by Tu T a ^ \hat{a} m Ngu e ^ ~ \tilde{\hat{e}} n-Phan: https://sites.google.com/site/tutamnguyenphan/van_Kampen.pdf
1933
Earlier work this paper cites.
E. R. van Kampen, Remark on the address of S. S. Cairns, in Lectures in Topology, 311–313, University of Michigan Press, Ann Arbor, MI, 1941
1941
Earlier work this paper cites.
A. Shapiro, Obstructions to the embedding of a complex in a Euclidean space, I, The first obstruction, Ann. Math. 66 (1957), 256–269
1957
Earlier work this paper cites.
W. T. Wu. On the realization of complexes in a euclidean space (in Chinese): I, Sci Sinica, 7 (1958) 251–297; II, Sci Sinica, 7 (1958) 365–387; III, Sci Sinica, 8 (1959) 133–150
1959
Earlier work this paper cites.
J. L. Bryant. Approximating embeddings of polyhedra in codimension 3, Trans. Amer. Math. Soc., 170 (1972) 85–95
1972
Earlier work this paper cites.
J. Hopcroft and R. E. Tarjan, Efficient planarity testing, J. of the Association for Computing Machinery, 21:4 (1974) 549–568
1974
Earlier work this paper cites.
* E. E. Moise. Geometric Topology in Dimensions 2 and 3 (GTM), Springer-Verlag, 1977
1977
Earlier work this paper cites.
B. Ummel. The product of nonplanar complexes does not imbed in 4-space, Trans. Amer. Math. Soc., 242 (1978) 319–328
1978
Earlier work this paper cites.
On a common generalization of Borsuk’s and Radon’s theorem,
E. G. Bajmóczy and I. Bárány, · 1979
Earlier work this paper cites.
J. L. Gross and R. H. Rosen , A linear time planarity algorithm for 2-complexes, Journal of the ACM, 26:4 (1979), 611–617
1979
Earlier work this paper cites.
On a topological generalization of a theorem of Tverberg,
I. Bárány, S. B. Shlosman, and A. Szűcs, · 1981
Earlier work this paper cites.
* C. Thomassen, Kuratowski’s theorem, J. Graph. Theory 5 (1981), 225–242
1981
Earlier work this paper cites.
B. Mohar
1989
Earlier work this paper cites.
K. S. Sarkaria. A one-dimensional Whitney trick and Kuratowski’s graph planarity criterion, Israel J. Math. 73 (1991), 79–89. http://kssarkaria.org/docs/One-dimensional.pdf
1991
Earlier work this paper cites.
K. S. Sarkaria. A generalized Van Kampen-Flores theorem, Proc. Am. Math. Soc. 111 (1991), 559–565
1991
Earlier work this paper cites.
A. Vučić and R. T. Živaljević , Note on a conjecture of Sierksma, Discr. Comput. Geom. 9 (1993), 339-349
1993
Earlier work this paper cites.
M. H. Freedman, V. S. Krushkal and P. Teichner. Van Kampen’s embedding obstruction is incomplete for 2-complexes in ℝ 4 {\mathbb{R}}^{4} , Math. Res. Letters. 1994. 1. P. 167-176
1994
Earlier work this paper cites.
V. I. Arnold, Topological invariants of plane curves and caustics, University Lecture Series, Vol. 5, Amer. Math. Soc., Providence, RI, 1995
1995
Earlier work this paper cites.
A. Yu. Volovikov, On a topological generalization of the Tverberg theorem. Math. Notes 59:3 (1996), 324–326
1996
Earlier work this paper cites.
A. Yu. Volovikov, On the van Kampen-Flores Theorem. Math. Notes 59:5 (1996), 477–481
1996
Earlier work this paper cites.
Yu. Makarychev. A short proof of Kuratowski’s graph planarity criterion, J. of Graph Theory, 25 (1997), 129–131
1997
Cited alongside, same era.
L. Lovasz and A. Schrijver, A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs, Proc. of AMS 126:5 (1998), 1275-1285
1998
Cited alongside, same era.
J. Segal, A. Skopenkov and S. Spież. Embeddings of polyhedra in ℝ m {\mathbb{R}}^{m} and the deleted product obstruction, Topol. Appl. 1998. 85. P. 225-234
1998
Cited alongside, same era.
2003
Cited alongside, same era.
* E. B. Vinberg. A Course in Algebra. Graduate Studies in Mathematics, vol. 56. 2003
2003
Cited alongside, same era.
2011
Later among the works it cites.
* G. M. Ziegler , 3N Colored Points in a Plane, Notices of the AMS, 58:4 (2011), 550-557
2011
Later among the works it cites.
2012
Later among the works it cites.
M. de Longueville. A course in topological combinatorics. Universitext. Springer, New York (2013)
2013
Later among the works it cites.
* M. Schaefer. Hanani-Tutte and related results. In Geometry — intuitive, discrete, and convex, Bolyai Soc. Math. Stud., 24 (2013), 259–299. http://ovid.cs.depaul.edu/documents/htsurvey.pdf
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Boyer, J. M. and Myrvold, W. J. On the cutting edge: simplified O ( n ) O(n) planarity by edge addition, Journal of Graph Algorithms and Applications, 8:3 (2004) 241–273
2004
Cited alongside, same era.
* R. Fokkink. A forgotten mathematician, Eur. Math. Soc. Newsletter 52 (2004) 9–14
2004
Cited alongside, same era.
* Y. Lin and A. Yang, On 3-cutwidth critical graphs, Discrete Mathematics, 275 (2004), 339–346
2004
Cited alongside, same era.
N. Robertson and P. Seymour. Graph Minors. XX. Wagner’s conjecture, J. of Comb. Theory, B, 92:2 (2004) 325–357
2004
Cited alongside, same era.
T. Schöneborn and G. Ziegler , The Topological Tverberg Theorem and Winding Numbers, J. Comb. Theory, Ser. A, 112:1 (2005) 82–104, arXiv:math/0409081
2005
Cited alongside, same era.
D. M. Thilikos, M. Serna and H. L. Bodlaender , Cutwidth I: A linear time fixed parameter algorithm, J. of Algorithms, 56:1 (2005), 1–24
2005
Cited alongside, same era.
* V. V. Prasolov. Elements of homology theory. 2007, GSM 74, AMS, Providence, RI
2007
Cited alongside, same era.
2013
Later among the works it cites.
2014
Later among the works it cites.
2015
Later among the works it cites.
2015
Later among the works it cites.
* I. Bárány, P. V. M. Blagojević and G. M. Ziegler. Tverberg’s Theorem at 50: Extensions and Counterexamples, Notices of the AMS, 63:7 (2016), 732–739
2016
Later among the works it cites.
* A. Chernov, A. Daynyak, A. Glibichuk, M. Ilyinskiy, A. Kupavskiy, A. Raigorodskiy and A. Skopenkov,
2016
Later among the works it cites.
* Handbook of Graph Drawing and Visualization. ed. by R. Tamassia, CRC Press, 2016
2016
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
* Invariants of graph drawings in the plane, presented by A. Enne, A. Ryabichev, A. Skopenkov and T. Zaitsev, http://www.turgor.ru/lktg/2017/6/index.htm
2017
Later among the works it cites.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2019
Closest in time.
M. Filakovský, U. Wagner, S. Zhechev. Embeddability of simplicial complexes is undecidable. Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, https://epubs.siam.org/doi/pdf/10.1137/1.9781611975994.47
2020
Closest in time.
* A. Skopenkov. Algebraic Topology From Geometric Viewpoint (in Russian), MCCME, Moscow, 2020 (2nd edition). Electronic version: http://www.mccme.ru/circles/oim/home/combtop13.htm#photo
2020
Closest in time.