Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference19 articles.
1. J. Battle, F. Harary, Y. Kodama and J. W. T. Youngs: Additivity of the genus of a graph, Bull. Amer. Math. Soc.68 (1962), 565–568.
2. G. Cairns and Y. Nikolayevsky: Bounds for generalized thrackles, Discrete Comput. Geam.23(2) (2000), 191–206.
3. É. Colin de Verdière, V. Kaluža, P. Paták, Z. Patáková and M. Tancer: A direct proof of the strong Hanani-Tutte theorem on the projective plane, J. Graph Algorithms Appl.21(5) (2017), 939–981.
4. R. Fulek and J. Kynčl: The ℤ2-genus of Kuratowski minors, Proceedings of the 34th International Symposium on Computational Geometry (SoCG 2018), Leibniz International Proceedings in Informatics (LIPIcs) 99, 40:1–10:14, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. 2018.
5. R. Fulek, J. Kynčl and D. Pálvölgyi: Unified Hanani-Tutte theorem. Electron. J. Combin.24(3) (2017), P3.18, 8 pp.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Embeddings of k-Complexes into 2k-Manifolds;Discrete & Computational Geometry;2023-10-16
2. Level-Planarity: Transitivity vs. Even Crossings;The Electronic Journal of Combinatorics;2022-11-04
3. The $$\mathbb {Z}_2$$-Genus of Kuratowski Minors;Discrete & Computational Geometry;2022-07-09
4. Atomic Embeddability, Clustered Planarity, and Thickenability;Journal of the ACM;2022-01-31
5. On the Strong Hanani-Tutte Theorem;The Electronic Journal of Combinatorics;2021-02-26