Huang, Yuanqiu; Ouyang, Zhangdong; Dong, Fengming On the sizes of bipartite 1-planar graphs. (English) Zbl 07356165 Electron. J. Comb. 28, No. 2, Research Paper P2.22, 17 p. (2021). MSC: 05C10 05C62 PDF BibTeX XML Cite \textit{Y. Huang} et al., Electron. J. Comb. 28, No. 2, Research Paper P2.22, 17 p. (2021; Zbl 07356165) Full Text: DOI
Ouyang, Zhang Dong; Dong, Feng Ming; Zhang, Rui Xue; Tay, Eng Guan Properties of \(\pi\)-skew graphs with applications. (English) Zbl 07347407 Acta Math. Sin., Engl. Ser. 37, No. 4, 641-656 (2021). MSC: 05C10 05C62 05C76 PDF BibTeX XML Cite \textit{Z. D. Ouyang} et al., Acta Math. Sin., Engl. Ser. 37, No. 4, 641--656 (2021; Zbl 07347407) Full Text: DOI
Duque, Frank; Fabila-Monroy, Ruy; Hernández-Vélez, César; Hidalgo-Toscano, Carlos Counting the number of crossings in geometric graphs. (English) Zbl 07306056 Inf. Process. Lett. 165, Article ID 106028, 5 p. (2021). MSC: 68Q PDF BibTeX XML Cite \textit{F. Duque} et al., Inf. Process. Lett. 165, Article ID 106028, 5 p. (2021; Zbl 07306056) Full Text: DOI
Mroczkowski, Maciej On some moves on links and the Hopf crossing number. (English) Zbl 1455.57014 Mediterr. J. Math. 18, No. 1, Paper No. 7, 17 p. (2021). MSC: 57K10 PDF BibTeX XML Cite \textit{M. Mroczkowski}, Mediterr. J. Math. 18, No. 1, Paper No. 7, 17 p. (2021; Zbl 1455.57014) Full Text: DOI
Patne, R. M.; Avachar, G. R. Drawing of a graph on a surface. (English) Zbl 1451.05156 Int. J. Math. Comput. Sci. 16, No. 2, 819-830 (2021). MSC: 05C62 68R10 PDF BibTeX XML Cite \textit{R. M. Patne} and \textit{G. R. Avachar}, Int. J. Math. Comput. Sci. 16, No. 2, 819--830 (2021; Zbl 1451.05156) Full Text: Link
Wang, Yuxi; Huang, Yuanqiu The crossing number of Cartesian product of 5-wheel with any tree. (English) Zbl 1453.05025 Discuss. Math., Graph Theory 41, No. 1, 183-197 (2021). MSC: 05C10 05C38 05C76 PDF BibTeX XML Cite \textit{Y. Wang} and \textit{Y. Huang}, Discuss. Math., Graph Theory 41, No. 1, 183--197 (2021; Zbl 1453.05025) Full Text: DOI
Wang, Jing; Ouyang, Zhangdong; Huang, Yuanqiu The Cartesian product graphs with crossing number two when a factor is a path. (Chinese. English summary) Zbl 07338408 Acta Math. Appl. Sin. 43, No. 1, 119-128 (2020). MSC: 05C10 05C62 PDF BibTeX XML Cite \textit{J. Wang} et al., Acta Math. Appl. Sin. 43, No. 1, 119--128 (2020; Zbl 07338408)
Gayathri, S.; Bharati, R. Crossing number bounds for mesh connected and 3-regular mesh of trees. (English) Zbl 07333448 J. Comb. Math. Comb. Comput. 113, 263-280 (2020). MSC: 05C62 05C30 05C05 05C10 PDF BibTeX XML Cite \textit{S. Gayathri} and \textit{R. Bharati}, J. Comb. Math. Comb. Comput. 113, 263--280 (2020; Zbl 07333448)
Fallon, Joshua; Hogenson, Kirsten; Keough, Lauren; Lomelí, Mario; Schaefer, Marcus; Soberon, Pablo A note on the maximum rectilinear crossing number of spiders. (English) Zbl 07333437 J. Comb. Math. Comb. Comput. 113, 127-139 (2020). MSC: 05C30 05C62 PDF BibTeX XML Cite \textit{J. Fallon} et al., J. Comb. Math. Comb. Comput. 113, 127--139 (2020; Zbl 07333437)
Clancy, Kieran; Haythorpe, Michael; Newcombe, Alex; Pegg, Ed jun. There are no cubic graphs on 26 vertices with crossing number 10 or 11. (English) Zbl 1459.05055 Graphs Comb. 36, No. 6, 1713-1721 (2020). MSC: 05C10 05C62 PDF BibTeX XML Cite \textit{K. Clancy} et al., Graphs Comb. 36, No. 6, 1713--1721 (2020; Zbl 1459.05055) Full Text: DOI
Akimoto, Yuta; Taniyama, Kouki Unknotting numbers and crossing numbers of spatial embeddings of a planar graph. (English) Zbl 1459.57003 J. Knot Theory Ramifications 29, No. 14, Article ID 2050095, 13 p. (2020). MSC: 57K10 05C10 PDF BibTeX XML Cite \textit{Y. Akimoto} and \textit{K. Taniyama}, J. Knot Theory Ramifications 29, No. 14, Article ID 2050095, 13 p. (2020; Zbl 1459.57003) Full Text: DOI
Ishikawa, Masaharu; Mattman, Thomas W.; Namiki, Kazuya; Shimokawa, Koya Alternating knots with large boundary slope diameter. (English) Zbl 1458.57007 Collin, Olivier (ed.) et al., Characters in low-dimensional topology. A conference celebrating the work of Steven Boyer, Université du Québec à Montréal, Montréal, Québec, Canada, June 2–6, 2018. Providence, RI: American Mathematical Society (AMS); Montreal: Centre de Recherches Mathématiques (CRM). Contemp. Math. 760, 207-216 (2020). MSC: 57K10 PDF BibTeX XML Cite \textit{M. Ishikawa} et al., Contemp. Math. 760, 207--216 (2020; Zbl 1458.57007) Full Text: DOI
Czabarka, Éva; Singgih, Inne; Székely, László; Wang, Zhiyu Some remarks on the midrange crossing constant. (English) Zbl 07301164 Stud. Sci. Math. Hung. 57, No. 2, 187-192 (2020). MSC: 05C10 52C10 05D40 PDF BibTeX XML Cite \textit{É. Czabarka} et al., Stud. Sci. Math. Hung. 57, No. 2, 187--192 (2020; Zbl 07301164) Full Text: DOI
K. C., Rajendra Prasad; Goudar, Venkanagouda M.; K. M., Niranjan Pathos vertex semi-middle graph of a tree. (English) Zbl 07296903 South East Asian J. Math. Math. Sci. 16, No. 1, 171-176 (2020). MSC: 05C05 05C10 05C45 05C75 PDF BibTeX XML Cite \textit{R. P. K. C.} et al., South East Asian J. Math. Math. Sci. 16, No. 1, 171--176 (2020; Zbl 07296903) Full Text: Link
Dong, Xiaoyuan; Ma, Dengju The crossing number of the bipartite permutation graph. (Chinese. English summary) Zbl 07295542 J. Nat. Sci. Heilongjiang Univ. 37, No. 3, 314-317 (2020). MSC: 05C10 05C62 PDF BibTeX XML Cite \textit{X. Dong} and \textit{D. Ma}, J. Nat. Sci. Heilongjiang Univ. 37, No. 3, 314--317 (2020; Zbl 07295542) Full Text: DOI
Arai, Masafumi; Taniyama, Kouki Knot diagrams on a punctured sphere as a model of string figures. (English) Zbl 1455.57003 J. Knot Theory Ramifications 29, No. 11, Article ID 2050071, 8 p. (2020). MSC: 57K10 57K20 PDF BibTeX XML Cite \textit{M. Arai} and \textit{K. Taniyama}, J. Knot Theory Ramifications 29, No. 11, Article ID 2050071, 8 p. (2020; Zbl 1455.57003) Full Text: DOI
Jabłonowski, Michał Triple-crossing number, the genus of a knot or link and torus knots. (English) Zbl 1455.57012 Topology Appl. 285, Article ID 107389, 5 p. (2020). MSC: 57K10 PDF BibTeX XML Cite \textit{M. Jabłonowski}, Topology Appl. 285, Article ID 107389, 5 p. (2020; Zbl 1455.57012) Full Text: DOI
Belousov, Yu. Semimeander crossing number of knots and related invariants. (English. Russian original) Zbl 1452.57003 J. Math. Sci., New York 251, No. 4, 444-452 (2020); translation from Zap. Nauchn. Semin. POMI 476, 20-33 (2018). MSC: 57K10 PDF BibTeX XML Cite \textit{Yu. Belousov}, J. Math. Sci., New York 251, No. 4, 444--452 (2020; Zbl 1452.57003); translation from Zap. Nauchn. Semin. POMI 476, 20--33 (2018) Full Text: DOI
Nagesh, Hadonahalli Mudalagiraiah On pathos block line cut-vertex graph of a tree. (English) Zbl 1451.05043 Commun. Korean Math. Soc. 35, No. 1, 1-12 (2020). MSC: 05C05 05C45 05C38 PDF BibTeX XML Cite \textit{H. M. Nagesh}, Commun. Korean Math. Soc. 35, No. 1, 1--12 (2020; Zbl 1451.05043) Full Text: DOI
Yasuda, Tomoyuki Amphicheirality of ribbon \(2\)-knots. (English) Zbl 1454.57011 J. Knot Theory Ramifications 29, No. 9, Article ID 2050069, 11 p. (2020). Reviewer: Inasa Nakamura (Kanazawa) MSC: 57K45 PDF BibTeX XML Cite \textit{T. Yasuda}, J. Knot Theory Ramifications 29, No. 9, Article ID 2050069, 11 p. (2020; Zbl 1454.57011) Full Text: DOI
Ding, Zongpeng Rotation and crossing numbers for join products. (English) Zbl 1451.05056 Bull. Malays. Math. Sci. Soc. (2) 43, No. 6, 4183-4196 (2020). MSC: 05C10 05C62 05C76 PDF BibTeX XML Cite \textit{Z. Ding}, Bull. Malays. Math. Sci. Soc. (2) 43, No. 6, 4183--4196 (2020; Zbl 1451.05056) Full Text: DOI
Aichholzer, Oswin; Duque, Frank; Fabila-Monroy, Ruy; García-Quintero, Oscar E.; Hidalgo-Toscano, Carlos An ongoing project to improve the rectilinear and the pseudolinear crossing constants. (English) Zbl 1447.05140 J. Graph Algorithms Appl. 24, No. 3, 421-432 (2020). MSC: 05C62 PDF BibTeX XML Cite \textit{O. Aichholzer} et al., J. Graph Algorithms Appl. 24, No. 3, 421--432 (2020; Zbl 1447.05140) Full Text: DOI
Gitler, Isidoro; Sandoval-Angeles, Gustavo An algorithm for delta-wye reduction of almost-planar graphs. (English) Zbl 1447.05195 Discrete Appl. Math. 285, 631-641 (2020). MSC: 05C85 05C10 PDF BibTeX XML Cite \textit{I. Gitler} and \textit{G. Sandoval-Angeles}, Discrete Appl. Math. 285, 631--641 (2020; Zbl 1447.05195) Full Text: DOI
de Mesmay, Arnaud; Schaefer, Marcus; Sedgwick, Eric Link crossing number is NP-hard. (English) Zbl 1455.57010 J. Knot Theory Ramifications 29, No. 6, Article ID 2050043, 15 p. (2020). Reviewer: Mehdi Yazdi (Oxford) MSC: 57K10 57M15 68Q17 68R10 PDF BibTeX XML Cite \textit{A. de Mesmay} et al., J. Knot Theory Ramifications 29, No. 6, Article ID 2050043, 15 p. (2020; Zbl 1455.57010) Full Text: DOI
Ouyang, Zhangdong A note on the crossing numbers of 5-regular graphs. (English) Zbl 1446.05025 Discuss. Math., Graph Theory 40, No. 4, 1127-1140 (2020). MSC: 05C10 05C62 PDF BibTeX XML Cite \textit{Z. Ouyang}, Discuss. Math., Graph Theory 40, No. 4, 1127--1140 (2020; Zbl 1446.05025) Full Text: DOI
Fulek, Radoslav; Tóth, Csaba D. Crossing minimization in perturbed drawings. (English) Zbl 1447.90070 J. Comb. Optim. 40, No. 2, 279-302 (2020). MSC: 90C35 05C10 05C38 68R10 PDF BibTeX XML Cite \textit{R. Fulek} and \textit{C. D. Tóth}, J. Comb. Optim. 40, No. 2, 279--302 (2020; Zbl 1447.90070) Full Text: DOI
Pach, János; Tóth, Géza A crossing lemma for multigraphs. (English) Zbl 1446.05026 Discrete Comput. Geom. 63, No. 4, 918-933 (2020). Reviewer: Juan José Montellano Ballesteros (Coyoacán) MSC: 05C10 05C35 05C30 PDF BibTeX XML Cite \textit{J. Pach} and \textit{G. Tóth}, Discrete Comput. Geom. 63, No. 4, 918--933 (2020; Zbl 1446.05026) Full Text: DOI
Goodhill, Sarah; Lowrance, Adam M.; Gonzales, Valeria Munoz; Rattray, Jessica; Zeh, Amelia The multi-region index of a knot. (English) Zbl 1439.57012 J. Knot Theory Ramifications 29, No. 4, Article ID 2050022, 16 p. (2020). MSC: 57K10 PDF BibTeX XML Cite \textit{S. Goodhill} et al., J. Knot Theory Ramifications 29, No. 4, Article ID 2050022, 16 p. (2020; Zbl 1439.57012) Full Text: DOI
Jabłonowski, Michał; Trojanowski, Łukasz Triple-crossing projections, moves on knots and links and their minimal diagrams. (English) Zbl 1444.57003 J. Knot Theory Ramifications 29, No. 4, Article ID 2050015, 23 p. (2020). Reviewer: Benjamin Bode (Osaka) MSC: 57K10 68R10 05C10 PDF BibTeX XML Cite \textit{M. Jabłonowski} and \textit{Ł. Trojanowski}, J. Knot Theory Ramifications 29, No. 4, Article ID 2050015, 23 p. (2020; Zbl 1444.57003) Full Text: DOI
Staš, Michal On the crossing number of the join of the wheel on five vertices with the discrete graph. (English) Zbl 1439.05065 Bull. Aust. Math. Soc. 101, No. 3, 353-361 (2020). MSC: 05C10 05C62 05C38 PDF BibTeX XML Cite \textit{M. Staš}, Bull. Aust. Math. Soc. 101, No. 3, 353--361 (2020; Zbl 1439.05065) Full Text: DOI
Huang, Yuanqiu; Wang, Yuxi The crossing number of \(K_{5,n+1} \setminus e\). (English) Zbl 07197508 Appl. Math. Comput. 376, Article ID 125075, 12 p. (2020). MSC: 05 01 PDF BibTeX XML Cite \textit{Y. Huang} and \textit{Y. Wang}, Appl. Math. Comput. 376, Article ID 125075, 12 p. (2020; Zbl 07197508) Full Text: DOI
Mroczkowski, Maciej Knots with Hopf crossing number at most one. (English) Zbl 1437.57011 Osaka J. Math. 57, No. 2, 279-304 (2020). MSC: 57K10 PDF BibTeX XML Cite \textit{M. Mroczkowski}, Osaka J. Math. 57, No. 2, 279--304 (2020; Zbl 1437.57011) Full Text: Euclid
Gangopadhyay, Rahul; Shannigrahi, Saswata \(k\)-sets and rectilinear crossings in complete uniform hypergraphs. (English) Zbl 1437.05171 Comput. Geom. 86, Article ID 101578, 7 p. (2020). MSC: 05C65 05C62 PDF BibTeX XML Cite \textit{R. Gangopadhyay} and \textit{S. Shannigrahi}, Comput. Geom. 86, Article ID 101578, 7 p. (2020; Zbl 1437.05171) Full Text: DOI
Staš, Michal On the crossing numbers of join products of five graphs of order six with the discrete graph. (English) Zbl 1437.05205 Opusc. Math. 40, No. 3, 383-397 (2020). MSC: 05C76 05C62 05C10 05C38 PDF BibTeX XML Cite \textit{M. Staš}, Opusc. Math. 40, No. 3, 383--397 (2020; Zbl 1437.05205) Full Text: DOI
Biedl, Therese; Chimani, Markus; Derka, Martin; Mutzel, Petra Crossing number for graphs with bounded pathwidth. (English) Zbl 1433.68280 Algorithmica 82, No. 2, 355-384 (2020). MSC: 68R10 68Q17 68Q27 68W25 PDF BibTeX XML Cite \textit{T. Biedl} et al., Algorithmica 82, No. 2, 355--384 (2020; Zbl 1433.68280) Full Text: DOI
Ábrego, Bernardo; Fernández-Merchant, Silvia; Lagoda, Evgeniya; Ramos, Pedro On the crossing number of 2-page book drawings of \(K_n\) with prescribed number of edges in each page. (English) Zbl 07185216 Graphs Comb. 36, No. 2, 303-318 (2020). MSC: 05 PDF BibTeX XML Cite \textit{B. Ábrego} et al., Graphs Comb. 36, No. 2, 303--318 (2020; Zbl 07185216) Full Text: DOI
Tarkaev, Vladimir Homological invariants of links in a thickened surface. (English) Zbl 07164417 Rev. R. Acad. Cienc. Exactas Fís. Nat., Ser. A Mat., RACSAM 114, No. 1, Paper No. 17, 19 p. (2020). MSC: 57M25 57M27 PDF BibTeX XML Cite \textit{V. Tarkaev}, Rev. R. Acad. Cienc. Exactas Fís. Nat., Ser. A Mat., RACSAM 114, No. 1, Paper No. 17, 19 p. (2020; Zbl 07164417) Full Text: DOI
Chimani, Markus; Hliněný, Petr; Salazar, Gelasio Toroidal grid minors and stretch in embedded graphs. (English) Zbl 1430.05122 J. Comb. Theory, Ser. B 140, 323-371 (2020). MSC: 05C83 05C85 PDF BibTeX XML Cite \textit{M. Chimani} et al., J. Comb. Theory, Ser. B 140, 323--371 (2020; Zbl 1430.05122) Full Text: DOI arXiv
Hliněný, Petr; Sankaran, Abhisekh Exact crossing number parameterized by vertex cover. (English) Zbl 07266125 Archambault, Daniel (ed.) et al., Graph drawing and network visualization. 27th international symposium, GD 2019, Prague, Czech Republic, September 17–20, 2019. Proceedings. Cham: Springer (ISBN 978-3-030-35801-3/pbk; 978-3-030-35802-0/ebook). Lecture Notes in Computer Science 11904, 307-319 (2019). MSC: 68R10 68U05 PDF BibTeX XML Cite \textit{P. Hliněný} and \textit{A. Sankaran}, Lect. Notes Comput. Sci. 11904, 307--319 (2019; Zbl 07266125) Full Text: DOI
Aichholzer, Oswin; Fabila-Monroy, Ruy; Fuchs, Adrian; Hidalgo-Toscano, Carlos; Parada, Irene; Vogtenhuber, Birgit; Zaragoza, Francisco On the 2-colored crossing number. (English) Zbl 07266108 Archambault, Daniel (ed.) et al., Graph drawing and network visualization. 27th international symposium, GD 2019, Prague, Czech Republic, September 17–20, 2019. Proceedings. Cham: Springer (ISBN 978-3-030-35801-3/pbk; 978-3-030-35802-0/ebook). Lecture Notes in Computer Science 11904, 87-100 (2019). MSC: 68R10 68U05 PDF BibTeX XML Cite \textit{O. Aichholzer} et al., Lect. Notes Comput. Sci. 11904, 87--100 (2019; Zbl 07266108) Full Text: DOI
Kelkar, Ashwini; Jaysurya, K.; Nagesh, Hadonahalli M. Block graph of a graph. (English) Zbl 07260503 Vladikavkaz. Mat. Zh. 21, No. 1, 74-78 (2019). MSC: 05C05 05C45 PDF BibTeX XML Cite \textit{A. Kelkar} et al., Vladikavkaz. Mat. Zh. 21, No. 1, 74--78 (2019; Zbl 07260503) Full Text: DOI MNR
Berežný, Štefan; Staš, Michal Cyclic permutations and crossing numbers of join products of two symmetric graphs of order six. (English) Zbl 07238223 Carpathian J. Math. 35, No. 2, 137-146 (2019). MSC: 05C10 05C38 PDF BibTeX XML Cite \textit{Š. Berežný} and \textit{M. Staš}, Carpathian J. Math. 35, No. 2, 137--146 (2019; Zbl 07238223)
Diao, Yuanan; Ernst, Claus; Por, Attila; Ziegler, Uta The ropelengths of knots are almost linear in terms of their crossing numbers. (English) Zbl 1441.57006 J. Knot Theory Ramifications 28, No. 14, Article ID 1950085, 64 p. (2019). Reviewer: Jonathan Hodgson (Swarthmore) MSC: 57K10 PDF BibTeX XML Cite \textit{Y. Diao} et al., J. Knot Theory Ramifications 28, No. 14, Article ID 1950085, 64 p. (2019; Zbl 1441.57006) Full Text: DOI
Kobayashi, Yasuaki; Kobayashi, Yusuke; Miyazaki, Shuichi; Tamaki, Suguru An improved fixed-parameter algorithm for max-cut parameterized by crossing number. (English) Zbl 07173542 Colbourn, Charles J. (ed.) et al., Combinatorial algorithms. 30th international workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019. Proceedings. Cham: Springer (ISBN 978-3-030-25004-1/pbk; 978-3-030-25005-8/ebook). Lecture Notes in Computer Science 11638, 327-338 (2019). MSC: 68Rxx 68Wxx PDF BibTeX XML Cite \textit{Y. Kobayashi} et al., Lect. Notes Comput. Sci. 11638, 327--338 (2019; Zbl 07173542) Full Text: DOI
Kawarabayashi, Ken-ichi; Sidiropoulos, Anastasios Polylogarithmic approximation for Euler genus on bounded degree graphs. (English) Zbl 1433.68299 Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 164-175 (2019). MSC: 68R10 05C10 05C85 68W25 68W40 PDF BibTeX XML Cite \textit{K.-i. Kawarabayashi} and \textit{A. Sidiropoulos}, in: Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC '19, Phoenix, AZ, USA, June 23--26, 2019. New York, NY: Association for Computing Machinery (ACM). 164--175 (2019; Zbl 1433.68299) Full Text: DOI
Wang, Jing; Zhang, Zuozheng; Huang, Yuanqiu On the join graphs with crossing number two. (Chinese. English summary) Zbl 1449.05081 Adv. Math., Beijing 48, No. 4, 497-503 (2019). MSC: 05C10 05C62 PDF BibTeX XML Cite \textit{J. Wang} et al., Adv. Math., Beijing 48, No. 4, 497--503 (2019; Zbl 1449.05081) Full Text: DOI
Gauci, John Baptist; Xuereb, Cheryl Zerafa A note on isomorphic generalized Petersen graphs with an application to the crossing number of \(GP[3k-1,k]\) and \(GP[3k+1,k]\). (English) Zbl 1449.05077 DML, Discrete Math. Lett. 2, 44-46 (2019). MSC: 05C10 05C62 PDF BibTeX XML Cite \textit{J. B. Gauci} and \textit{C. Z. Xuereb}, DML, Discrete Math. Lett. 2, 44--46 (2019; Zbl 1449.05077) Full Text: Link
Ouyang, Zhangdong; Ge, Jun; Chen, Yichao Remarks on the joins of 1-planar graphs. (English) Zbl 1433.05089 Appl. Math. Comput. 362, Article ID 124537, 7 p. (2019). MSC: 05C10 05C62 PDF BibTeX XML Cite \textit{Z. Ouyang} et al., Appl. Math. Comput. 362, Article ID 124537, 7 p. (2019; Zbl 1433.05089) Full Text: DOI
Asplund, John; Clark, Gregory; Cochran, Garner; Czabarka, Éva; Hamm, Arran; Spencer, Gwen; Székely, László; Taylor, Libby; Wang, Zhiyu Using block designs in crossing number bounds. (English) Zbl 1427.05060 J. Comb. Des. 27, No. 10, 586-597 (2019). MSC: 05C10 05B05 05C62 05D40 05C85 PDF BibTeX XML Cite \textit{J. Asplund} et al., J. Comb. Des. 27, No. 10, 586--597 (2019; Zbl 1427.05060) Full Text: DOI
Adams, Colin; Hoste, Jim; Palmer, Martin Triple-crossing number and moves on triple-crossing link diagrams. (English) Zbl 1431.57001 J. Knot Theory Ramifications 28, No. 11, Article ID 1940001, 19 p. (2019). Reviewer: Benjamin Bode (Osaka) MSC: 57K10 PDF BibTeX XML Cite \textit{C. Adams} et al., J. Knot Theory Ramifications 28, No. 11, Article ID 1940001, 19 p. (2019; Zbl 1431.57001) Full Text: DOI
Zhang, Xin Upper bound on the sum of powers of the degrees of graphs with few crossings per edge. (English) Zbl 1428.05069 Appl. Math. Comput. 350, 163-169 (2019). MSC: 05C07 05C10 92E10 PDF BibTeX XML Cite \textit{X. Zhang}, Appl. Math. Comput. 350, 163--169 (2019; Zbl 1428.05069) Full Text: DOI
Fox, Jacob; Pach, János; Suk, Andrew Approximating the rectilinear crossing number. (English) Zbl 1431.90162 Comput. Geom. 81, 45-53 (2019). MSC: 90C35 90C27 PDF BibTeX XML Cite \textit{J. Fox} et al., Comput. Geom. 81, 45--53 (2019; Zbl 1431.90162) Full Text: DOI
Panagiotou, Eleni Topological entanglement and its relation to polymer material properties. (English) Zbl 1425.92227 Adams, Colin C. (ed.) et al., Knots, low-dimensional topology and applications. Knots in Hellas, International Olympic Academy, Greece, July 2016. Papers of the international conference, Ancient Olympia, Greece, July 17–23, 2016. Cham: Springer. Springer Proc. Math. Stat. 284, 435-447 (2019). MSC: 92E10 57M99 82D60 PDF BibTeX XML Cite \textit{E. Panagiotou}, Springer Proc. Math. Stat. 284, 435--447 (2019; Zbl 1425.92227) Full Text: DOI
Knox, Fiachra; Mohar, Bojan; Wood, David R. A golden ratio inequality for vertex degrees of graphs. (English) Zbl 1420.05039 Am. Math. Mon. 126, No. 8, 742-747 (2019). MSC: 05C07 PDF BibTeX XML Cite \textit{F. Knox} et al., Am. Math. Mon. 126, No. 8, 742--747 (2019; Zbl 1420.05039) Full Text: DOI arXiv
Silva, André C.; Arroyo, Alan; Richter, R. Bruce; Lee, Orlando Graphs with at most one crossing. (English) Zbl 1419.05152 Discrete Math. 342, No. 11, 3201-3207 (2019). MSC: 05C62 05C10 PDF BibTeX XML Cite \textit{A. C. Silva} et al., Discrete Math. 342, No. 11, 3201--3207 (2019; Zbl 1419.05152) Full Text: DOI
Balogh, József; Lidický, Bernard; Salazar, Gelasio Closing in on Hill’s conjecture. (English) Zbl 1419.05050 SIAM J. Discrete Math. 33, No. 3, 1261-1276 (2019). MSC: 05C10 05C62 68R10 PDF BibTeX XML Cite \textit{J. Balogh} et al., SIAM J. Discrete Math. 33, No. 3, 1261--1276 (2019; Zbl 1419.05050) Full Text: DOI arXiv
Haythorpe, Michael; Newcombe, Alex On the crossing number of the Cartesian product of a sunlet graph and a star graph. (English) Zbl 1416.05241 Bull. Aust. Math. Soc. 100, No. 1, 5-12 (2019). MSC: 05C76 05C10 68R10 PDF BibTeX XML Cite \textit{M. Haythorpe} and \textit{A. Newcombe}, Bull. Aust. Math. Soc. 100, No. 1, 5--12 (2019; Zbl 1416.05241) Full Text: DOI arXiv
Staš, Michal Determining crossing number of join of the discrete graph with two symmetric graphs of order five. (English) Zbl 1416.05194 Symmetry 11, No. 2, Paper No. 123, 9 p. (2019). MSC: 05C62 05C76 PDF BibTeX XML Cite \textit{M. Staš}, Symmetry 11, No. 2, Paper No. 123, 9 p. (2019; Zbl 1416.05194) Full Text: DOI
Heap, Aaron; Knowles, Douglas Space-efficient knot mosaics for prime knots with mosaic number 6. (English) Zbl 1426.57008 Involve 12, No. 5, 767-789 (2019). MSC: 57K10 PDF BibTeX XML Cite \textit{A. Heap} and \textit{D. Knowles}, Involve 12, No. 5, 767--789 (2019; Zbl 1426.57008) Full Text: DOI
Blair, Ryan; Kjuchukova, Alexandra; Ozawa, Makoto The incompatibility of crossing number and bridge number for knot diagrams. (English) Zbl 1425.57009 Discrete Math. 342, No. 7, 1966-1978 (2019). Reviewer: Dieter Erle (Dortmund) MSC: 57M27 57M25 PDF BibTeX XML Cite \textit{R. Blair} et al., Discrete Math. 342, No. 7, 1966--1978 (2019; Zbl 1425.57009) Full Text: DOI
Cristofaro-Gardiner, Dan Symplectic embeddings from concave toric domains into convex ones. (English) Zbl 1440.53084 J. Differ. Geom. 112, No. 2, 199-232 (2019). Reviewer: Adara M. Blaga (Timişoara) MSC: 53D05 53D10 PDF BibTeX XML Cite \textit{D. Cristofaro-Gardiner}, J. Differ. Geom. 112, No. 2, 199--232 (2019; Zbl 1440.53084) Full Text: DOI Euclid arXiv
Bettersworth, Zac; Ernst, Claus Incoherent nullification of torus knots and links. (English) Zbl 1422.57011 J. Knot Theory Ramifications 28, No. 5, Article ID 1950033, 23 p. (2019). Reviewer: Kenneth A. Perko Jr. (New York) MSC: 57M25 92E99 PDF BibTeX XML Cite \textit{Z. Bettersworth} and \textit{C. Ernst}, J. Knot Theory Ramifications 28, No. 5, Article ID 1950033, 23 p. (2019; Zbl 1422.57011) Full Text: DOI
Nishida, Daishiro Triple crossing number and double crossing braid index. (English) Zbl 1410.57008 J. Knot Theory Ramifications 28, No. 2, Article ID 1950002, 15 p. (2019). Reviewer: Kenneth A. Perko Jr. (New York) MSC: 57M25 57M27 PDF BibTeX XML Cite \textit{D. Nishida}, J. Knot Theory Ramifications 28, No. 2, Article ID 1950002, 15 p. (2019; Zbl 1410.57008) Full Text: DOI arXiv
Asplund, John; Do, Thao; Hamm, Arran; Jain, Vishesh On the \(k\)-planar local crossing number. (English) Zbl 1405.05140 Discrete Math. 342, No. 4, 927-933 (2019). MSC: 05C70 05C62 PDF BibTeX XML Cite \textit{J. Asplund} et al., Discrete Math. 342, No. 4, 927--933 (2019; Zbl 1405.05140) Full Text: DOI arXiv
Wang, Jing; Ouyang, Zhangdong; Huang, Yuanqiu The crossing number of the hexagonal graph \(H_{3,n}\). (English) Zbl 1404.05038 Discuss. Math., Graph Theory 39, No. 2, 547-554 (2019). MSC: 05C10 05C62 05C76 PDF BibTeX XML Cite \textit{J. Wang} et al., Discuss. Math., Graph Theory 39, No. 2, 547--554 (2019; Zbl 1404.05038) Full Text: DOI
Anderson, Nicole; Breunig, Michael; Goryl, Kyle; Lewis, Hannah; Riehl, Manda; Scanlan, McKenzie Properties of RNA secondary structure matching models. (English) Zbl 1403.92198 Involve 12, No. 2, 257-280 (2019). MSC: 92D20 05C90 PDF BibTeX XML Cite \textit{N. Anderson} et al., Involve 12, No. 2, 257--280 (2019; Zbl 1403.92198) Full Text: DOI
Pach, János; Tóth, Géza A Crossing Lemma for multigraphs. (English) Zbl 07236469 Speckmann, Bettina (ed.) et al., 34th international symposium on computational geometry, SoCG 2018, June 11–14, 2018, Budapest, Hungary. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-066-8). LIPIcs – Leibniz International Proceedings in Informatics 99, Article 65, 13 p. (2018). MSC: 68U05 PDF BibTeX XML Cite \textit{J. Pach} and \textit{G. Tóth}, LIPIcs -- Leibniz Int. Proc. Inform. 99, Article 65, 13 p. (2018; Zbl 07236469) Full Text: DOI
Dvořák, Zdeněk; Hliněný, Petr; Mohar, Bojan Structure and generation of crossing-critical graphs. (English) Zbl 07236437 Speckmann, Bettina (ed.) et al., 34th international symposium on computational geometry, SoCG 2018, June 11–14, 2018, Budapest, Hungary. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-066-8). LIPIcs – Leibniz International Proceedings in Informatics 99, Article 33, 14 p. (2018). MSC: 68U05 PDF BibTeX XML Cite \textit{Z. Dvořák} et al., LIPIcs -- Leibniz Int. Proc. Inform. 99, Article 33, 14 p. (2018; Zbl 07236437) Full Text: DOI
Berežný, Štefan; Staš, Michal Cyclic permutations and crossing numbers of join products of symmetric graph of order six. (English) Zbl 1449.05072 Carpathian J. Math. 34, No. 2, 143-155 (2018). MSC: 05C10 05C38 05C62 PDF BibTeX XML Cite \textit{Š. Berežný} and \textit{M. Staš}, Carpathian J. Math. 34, No. 2, 143--155 (2018; Zbl 1449.05072)
Su, Zhenhua The crossing numbers of \(K_{5}+P_{n}\). (English) Zbl 1424.05062 J. Math. Res. Appl. 38, No. 4, 331-340 (2018). MSC: 05C10 05C38 PDF BibTeX XML Cite \textit{Z. Su}, J. Math. Res. Appl. 38, No. 4, 331--340 (2018; Zbl 1424.05062) Full Text: DOI
Bokal, Drago; Leaños, Jesús Characterizing all graphs with 2-exceptional edges. (English) Zbl 1411.05063 Ars Math. Contemp. 15, No. 2, 383-406 (2018). MSC: 05C10 05C62 PDF BibTeX XML Cite \textit{D. Bokal} and \textit{J. Leaños}, Ars Math. Contemp. 15, No. 2, 383--406 (2018; Zbl 1411.05063) Full Text: DOI
Tarkaev, V. V. A lower bound for the crossing number of links in thickened surfaces. (English. Russian original) Zbl 1411.57018 Sib. Math. J. 59, No. 6, 1125-1132 (2018); translation from Sib. Mat. Zh. 59, No. 6, 1412-1422 (2018). MSC: 57M25 PDF BibTeX XML Cite \textit{V. V. Tarkaev}, Sib. Math. J. 59, No. 6, 1125--1132 (2018; Zbl 1411.57018); translation from Sib. Mat. Zh. 59, No. 6, 1412--1422 (2018) Full Text: DOI
Yang, Xiwu; Li, Xiyue The crossing number of the complete 4-partite graph \(K_{1,3,3,n}\). (Chinese. English summary) Zbl 1424.05063 J. Liaoning Norm. Univ., Nat. Sci. 41, No. 2, 159-164 (2018). MSC: 05C10 05C62 PDF BibTeX XML Cite \textit{X. Yang} and \textit{X. Li}, J. Liaoning Norm. Univ., Nat. Sci. 41, No. 2, 159--164 (2018; Zbl 1424.05063) Full Text: DOI
Han, Youfa; Wang, Shuxin; Zhang, Dawei The polygon presentation of pretzel links. (Chinese. English summary) Zbl 1424.57001 Adv. Math., Beijing 47, No. 3, 475-480 (2018). MSC: 57M25 PDF BibTeX XML Cite \textit{Y. Han} et al., Adv. Math., Beijing 47, No. 3, 475--480 (2018; Zbl 1424.57001) Full Text: DOI
Fulek, Radoslav; Tóth, Csaba D. Crossing minimization in perturbed drawings. (English) Zbl 07023827 Biedl, Therese (ed.) et al., Graph drawing and network visualization. 26th international symposium, GD 2018, Barcelona, Spain, September 26–28, 2018. Proceedings. Cham: Springer (ISBN 978-3-030-04413-8/pbk; 978-3-030-04414-5/ebook). Lecture Notes in Computer Science 11282, 229-241 (2018). MSC: 68R10 68U05 PDF BibTeX XML Cite \textit{R. Fulek} and \textit{C. D. Tóth}, Lect. Notes Comput. Sci. 11282, 229--241 (2018; Zbl 07023827) Full Text: DOI
Nagesh, Hadonahalli Mudalagiraiah On pathos block line graph of a tree. (English) Zbl 1404.05030 Gulf J. Math. 6, No. 1, 104-109 (2018). MSC: 05C05 05C45 05C76 PDF BibTeX XML Cite \textit{H. M. Nagesh}, Gulf J. Math. 6, No. 1, 104--109 (2018; Zbl 1404.05030) Full Text: Link
Wang, Yan Pfaffian polyominos on the Klein bottle. (English) Zbl 1405.05042 J. Math. Chem. 56, No. 10, 3147-3160 (2018). MSC: 05C10 05C30 05C45 92D20 PDF BibTeX XML Cite \textit{Y. Wang}, J. Math. Chem. 56, No. 10, 3147--3160 (2018; Zbl 1405.05042) Full Text: DOI
Ozeki, Kenta; Zamfirescu, Carol T. Every 4-connected graph with crossing number 2 is Hamiltonian. (English) Zbl 1401.05175 SIAM J. Discrete Math. 32, No. 4, 2783-2794 (2018). MSC: 05C45 05C10 05C38 PDF BibTeX XML Cite \textit{K. Ozeki} and \textit{C. T. Zamfirescu}, SIAM J. Discrete Math. 32, No. 4, 2783--2794 (2018; Zbl 1401.05175) Full Text: DOI
Staš, Michal Determining crossing numbers of graphs of order six using cyclic permutations. (English) Zbl 1402.05050 Bull. Aust. Math. Soc. 98, No. 3, 353-362 (2018). MSC: 05C10 05C38 PDF BibTeX XML Cite \textit{M. Staš}, Bull. Aust. Math. Soc. 98, No. 3, 353--362 (2018; Zbl 1402.05050) Full Text: DOI
Ding, Zongpeng; Huang, Yuanqiu; Ouyang, Zhangdong The crossing numbers of Cartesian products of path with some graphs. (English) Zbl 06986935 Ars Comb. 141, 101-110 (2018). MSC: 05C10 05C62 PDF BibTeX XML Cite \textit{Z. Ding} et al., Ars Comb. 141, 101--110 (2018; Zbl 06986935)
Anderson, Robin; Bai, Shuliang; Barrera-Cruz, Fidel; Czabarka, Éva; Da Lozzo, Giordano; Hobson, Natalie L. F.; Lin, Jephian C.-H.; Mohr, Austin; Smith, Heather C.; Székely, László A.; Whitlatch, Hays Analogies between the crossing number and the tangle crossing number. (English) Zbl 1400.05051 Electron. J. Comb. 25, No. 4, Research Paper P4.24, 15 p. (2018). MSC: 05C05 05C62 68Q25 PDF BibTeX XML Cite \textit{R. Anderson} et al., Electron. J. Comb. 25, No. 4, Research Paper P4.24, 15 p. (2018; Zbl 1400.05051) Full Text: Link
Ábrego, Bernardo M.; Aichholzer, Oswin; Fernández-Merchant, Silvia; McQuillan, Dan; Mohar, Bojan; Mutzel, Petra; Ramos, Pedro; Richter, R. Bruce; Vogtenhuber, Birgit Bishellable drawings of \(K_n\). (English) Zbl 1400.05061 SIAM J. Discrete Math. 32, No. 4, 2482-2492 (2018). MSC: 05C10 05C62 68R10 PDF BibTeX XML Cite \textit{B. M. Ábrego} et al., SIAM J. Discrete Math. 32, No. 4, 2482--2492 (2018; Zbl 1400.05061) Full Text: DOI arXiv
Kalfagianni, Efstratia A Jones slopes characterization of adequate knots. (English) Zbl 1417.57014 Indiana Univ. Math. J. 67, No. 1, 205-219 (2018). Reviewer: Leonid Plachta (Kraków) MSC: 57M27 57M25 PDF BibTeX XML Cite \textit{E. Kalfagianni}, Indiana Univ. Math. J. 67, No. 1, 205--219 (2018; Zbl 1417.57014) Full Text: DOI arXiv
Audoux, Benjamin; Bellingeri, Paolo; Meilhan, Jean-Baptiste; Wagner, Emmanuel Extensions of some classical local moves on knot diagrams. (English) Zbl 1406.57003 Mich. Math. J. 67, No. 3, 647-672 (2018). Reviewer: Celeste Damiani (Leeds) MSC: 57M25 57Q45 57M27 20F36 PDF BibTeX XML Cite \textit{B. Audoux} et al., Mich. Math. J. 67, No. 3, 647--672 (2018; Zbl 1406.57003) Full Text: DOI Euclid arXiv
Korablëv, F. G.; May, Ya. K.; Tarkaev, V. V. Classification of low complexity knotoids. (Russian. English summary) Zbl 1401.57022 Sib. Èlektron. Mat. Izv. 15, 1237-1244 (2018). MSC: 57M25 PDF BibTeX XML Cite \textit{F. G. Korablëv} et al., Sib. Èlektron. Mat. Izv. 15, 1237--1244 (2018; Zbl 1401.57022) Full Text: DOI
Gokan, Yusuke; Katsumata, Hayato; Nakajima, Katsuya; Shimizu, Ayaka; Yaguchi, Yoshiro A note on the cross-index of a complete graph based on a linear tree. (English) Zbl 1400.05140 J. Knot Theory Ramifications 27, No. 11, Article ID 1843010, 24 p. (2018). MSC: 05C45 05C10 57M25 PDF BibTeX XML Cite \textit{Y. Gokan} et al., J. Knot Theory Ramifications 27, No. 11, Article ID 1843010, 24 p. (2018; Zbl 1400.05140) Full Text: DOI arXiv
Rodrigo, Javier; López, Ma. Dolores An improvement of the lower bound on the maximum number of halving lines in planar sets with 32 points. (English) Zbl 1408.52028 Garijo, Delia (ed.) et al., Discrete mathematics days 2018. Extended abstracts of the 11th “Jornadas de matemática discreta y algorítmica” (JMDA), Sevilla, Spain, June 27–29, 2018. Amsterdam: Elsevier. Electron. Notes Discrete Math. 68, 305-310 (2018). Reviewer: Et-Taoui, Boumédiène (Lutterbach) MSC: 52C10 PDF BibTeX XML Cite \textit{J. Rodrigo} and \textit{Ma. D. López}, Electron. Notes Discrete Math. 68, 305--310 (2018; Zbl 1408.52028) Full Text: DOI
Yasuda, Tomoyuki Ribbon 2-knots of ribbon crossing number four. (English) Zbl 1401.57037 J. Knot Theory Ramifications 27, No. 10, Article ID 1850058, 20 p. (2018). Reviewer: Inasa Nakamura (Kanazawa) MSC: 57Q45 57M25 PDF BibTeX XML Cite \textit{T. Yasuda}, J. Knot Theory Ramifications 27, No. 10, Article ID 1850058, 20 p. (2018; Zbl 1401.57037) Full Text: DOI
Howards, Hugh; Kobin, Andrew Crossing number bounds in knot mosaics. (English) Zbl 1402.57009 J. Knot Theory Ramifications 27, No. 10, Article ID 1850056, 30 p. (2018). MSC: 57M25 57M27 PDF BibTeX XML Cite \textit{H. Howards} and \textit{A. Kobin}, J. Knot Theory Ramifications 27, No. 10, Article ID 1850056, 30 p. (2018; Zbl 1402.57009) Full Text: DOI
Clark, Gregory J.; Spencer, Gwen New bounds on the biplanar crossing number of low-dimensional hypercubes: how low can you go? (English) Zbl 1400.05164 Bull. Inst. Comb. Appl. 83, 52-60 (2018). MSC: 05C62 05C10 PDF BibTeX XML Cite \textit{G. J. Clark} and \textit{G. Spencer}, Bull. Inst. Comb. Appl. 83, 52--60 (2018; Zbl 1400.05164)
Asplund, John; Do, Thao; Hamm, Arran; Székely, László; Taylor, Libby; Wang, Zhiyu \(k\)-planar crossing number of random graphs and random regular graphs. (English) Zbl 1394.05113 Discrete Appl. Math. 247, 419-422 (2018). MSC: 05C80 PDF BibTeX XML Cite \textit{J. Asplund} et al., Discrete Appl. Math. 247, 419--422 (2018; Zbl 1394.05113) Full Text: DOI
Lingqi, Zhao; Xirong, Xu; Siqin, Bai; Huifeng, Zhang; Yuansheng, Yang The crossing number of locally twisted cubes \(L T Q_n\). (English) Zbl 1394.05082 Discrete Appl. Math. 247, 407-418 (2018). MSC: 05C62 05C82 PDF BibTeX XML Cite \textit{Z. Lingqi} et al., Discrete Appl. Math. 247, 407--418 (2018; Zbl 1394.05082) Full Text: DOI
Bujtás, Csilla; Tuza, Zsolt Partition-crossing hypergraphs. (English) Zbl 1413.05177 Acta Cybern. 23, No. 3, 815-828 (2018). MSC: 05C35 05C15 05C65 05C70 PDF BibTeX XML Cite \textit{C. Bujtás} and \textit{Z. Tuza}, Acta Cybern. 23, No. 3, 815--828 (2018; Zbl 1413.05177) Full Text: DOI arXiv
Yasuda, Tomoyuki Ribbon crossing numbers, crossing numbers, and Alexander polynomials. (English) Zbl 1404.57043 Topology Appl. 247, 72-80 (2018). Reviewer: Michał Jabłonowski (Gdansk) MSC: 57Q45 57M25 PDF BibTeX XML Cite \textit{T. Yasuda}, Topology Appl. 247, 72--80 (2018; Zbl 1404.57043) Full Text: DOI
Chekuri, Chandra; Sidiropoulos, Anastasios Approximation algorithms for Euler genus and related problems. (English) Zbl 1398.68663 SIAM J. Comput. 47, No. 4, 1610-1643 (2018). MSC: 68W25 05C10 05C85 68R10 68W40 PDF BibTeX XML Cite \textit{C. Chekuri} and \textit{A. Sidiropoulos}, SIAM J. Comput. 47, No. 4, 1610--1643 (2018; Zbl 1398.68663) Full Text: DOI
Ding, Zongpeng; Huang, Yuanqiu The crossing numbers of join of some graphs with \(n\) isolated vertices. (English) Zbl 1392.05030 Discuss. Math., Graph Theory 38, No. 4, 899-909 (2018). MSC: 05C10 05C38 PDF BibTeX XML Cite \textit{Z. Ding} and \textit{Y. Huang}, Discuss. Math., Graph Theory 38, No. 4, 899--909 (2018; Zbl 1392.05030) Full Text: DOI
Alfaro, Carlos A.; Arroyo, Alan; Derňár, Marek; Mohar, Bojan The crossing number of the cone of a graph. (English) Zbl 1398.68383 SIAM J. Discrete Math. 32, No. 3, 2080-2093 (2018). MSC: 68R10 05C62 PDF BibTeX XML Cite \textit{C. A. Alfaro} et al., SIAM J. Discrete Math. 32, No. 3, 2080--2093 (2018; Zbl 1398.68383) Full Text: DOI
Hliněný, Petr; Thomassen, Carsten Deciding parity of graph crossing number. (English) Zbl 1393.05087 SIAM J. Discrete Math. 32, No. 3, 1962-1965 (2018). MSC: 05C10 68Q25 PDF BibTeX XML Cite \textit{P. Hliněný} and \textit{C. Thomassen}, SIAM J. Discrete Math. 32, No. 3, 1962--1965 (2018; Zbl 1393.05087) Full Text: DOI
Aboufattoum, Ayman; Elsakhawy, Elsyed A.; Istvan, Kyle; Qazaqzeh, Khaled Kauffman polynomial of periodic knotted trivalent graphs. (English) Zbl 1407.57009 Bull. Korean Math. Soc. 55, No. 3, 799-808 (2018). Reviewer: Joel Foisy (Potsdam, NY) MSC: 57M27 57M15 PDF BibTeX XML Cite \textit{A. Aboufattoum} et al., Bull. Korean Math. Soc. 55, No. 3, 799--808 (2018; Zbl 1407.57009) Full Text: Link
Altıntaş, İsmet Introduction to disoriented knot theory. (English) Zbl 1392.57003 Open Math. 16, 346-357 (2018). MSC: 57M25 57M27 PDF BibTeX XML Cite \textit{İ. Altıntaş}, Open Math. 16, 346--357 (2018; Zbl 1392.57003) Full Text: DOI