Wang, Jing; Cai, Junliang; Lv, Shengxiang; Huang, Yuanqiu The crossing number of hexagonal graph \(H_{3,n }\) in the projective plane. (English) Zbl 1479.05234 Discuss. Math., Graph Theory 42, No. 1, 197-218 (2022). MSC: 05C62 05C10 05C76 51E20 PDFBibTeX XMLCite \textit{J. Wang} et al., Discuss. Math., Graph Theory 42, No. 1, 197--218 (2022; Zbl 1479.05234) Full Text: DOI
Clancy, Kieran; Haythorpe, Michael; Newcombe, Alex A survey of graphs with known or bounded crossing numbers. (English) Zbl 1453.05024 Australas. J. Comb. 78, Part 2, 209-296 (2020). MSC: 05C10 05C75 05C76 PDFBibTeX XMLCite \textit{K. Clancy} et al., Australas. J. Comb. 78, Part 2, 209--296 (2020; Zbl 1453.05024) Full Text: arXiv Link
Huang, Yuanqiu; Zhao, Tinglei; Ding, Zongpeng Graphs whose crossing numbers are the same as those of their line graphs. (English) Zbl 1444.05117 Australas. J. Comb. 77, Part 2, 224-248 (2020). MSC: 05C76 PDFBibTeX XMLCite \textit{Y. Huang} et al., Australas. J. Comb. 77, Part 2, 224--248 (2020; Zbl 1444.05117) Full Text: Link
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 PDFBibTeX XMLCite \textit{M. Chimani} et al., J. Comb. Theory, Ser. B 140, 323--371 (2020; Zbl 1430.05122) 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 PDFBibTeX XMLCite \textit{J. Wang} et al., Discuss. Math., Graph Theory 39, No. 2, 547--554 (2019; Zbl 1404.05038) Full Text: DOI
Suk, Andrew \(k\)-quasi-planar graphs. (English) Zbl 1271.05069 van Kreveld, Marc (ed.) et al., Graph drawing. 19th international symposium, GD 2011, Eindhoven, The Netherlands, September 21–23, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25877-0/pbk). Lecture Notes in Computer Science 7034, 266-277 (2012). MSC: 05C62 68R10 PDFBibTeX XMLCite \textit{A. Suk}, Lect. Notes Comput. Sci. 7034, 266--277 (2012; Zbl 1271.05069) Full Text: DOI arXiv
Bokal, Drago; Czabarka, Éva; Székely, László A.; Vrt’o, Imrich General lower bounds for the minor crossing number of graphs. (English) Zbl 1194.05024 Discrete Comput. Geom. 44, No. 2, 463-483 (2010). MSC: 05C10 05C83 PDFBibTeX XMLCite \textit{D. Bokal} et al., Discrete Comput. Geom. 44, No. 2, 463--483 (2010; Zbl 1194.05024) Full Text: DOI
Huang, Yuanqiu; Zhao, Tinglei The crossing number of \(K_{1,4,n}\). (English) Zbl 1135.05016 Discrete Math. 308, No. 9, 1634-1638 (2008). MSC: 05C10 PDFBibTeX XMLCite \textit{Y. Huang} and \textit{T. Zhao}, Discrete Math. 308, No. 9, 1634--1638 (2008; Zbl 1135.05016) Full Text: DOI
Klešč, Marián; Kocúrová, Anna The crossing numbers of products of 5-vertex graphs with cycles. (English) Zbl 1118.05021 Discrete Math. 307, No. 11-12, 1395-1403 (2007). MSC: 05C10 05C38 PDFBibTeX XMLCite \textit{M. Klešč} and \textit{A. Kocúrová}, Discrete Math. 307, No. 11--12, 1395--1403 (2007; Zbl 1118.05021) Full Text: DOI
Hliněný, Petr Crossing number is hard for cubic graphs. (English) Zbl 1092.05016 J. Comb. Theory, Ser. B 96, No. 4, 455-471 (2006). MSC: 05C10 68R10 PDFBibTeX XMLCite \textit{P. Hliněný}, J. Comb. Theory, Ser. B 96, No. 4, 455--471 (2006; Zbl 1092.05016) Full Text: DOI
Székely, László A. A successful concept for measuring non-planarity of graphs: The crossing number. (English) Zbl 1035.05034 Discrete Math. 276, No. 1-3, 331-352 (2004). Reviewer: Arthur T. White (Kalamazoo) MSC: 05C10 PDFBibTeX XMLCite \textit{L. A. Székely}, Discrete Math. 276, No. 1--3, 331--352 (2004; Zbl 1035.05034) Full Text: DOI
Juarez, Hector A.; Salazar, Gelasio Drawings of \(C_m\times C_n\) with one disjoint family. II. (English) Zbl 1027.05032 J. Comb. Theory, Ser. B 82, No. 1, 161-165 (2001). MSC: 05C10 PDFBibTeX XMLCite \textit{H. A. Juarez} and \textit{G. Salazar}, J. Comb. Theory, Ser. B 82, No. 1, 161--165 (2001; Zbl 1027.05032) Full Text: DOI
Salazar, Gelasio A lower bound for the crossing number of \(C_m\times C_n\). (English) Zbl 0959.05063 J. Graph Theory 35, No. 3, 222-226 (2000). Reviewer: Peter Horák (Safat) MSC: 05C35 05C10 PDFBibTeX XMLCite \textit{G. Salazar}, J. Graph Theory 35, No. 3, 222--226 (2000; Zbl 0959.05063) Full Text: DOI
Salazar, Gelasio Drawings of \(C_m\times C_n\) with one disjoint family. (English) Zbl 0935.05038 J. Comb. Theory, Ser. B 76, No. 2, 129-135 (1999). Reviewer: Arthur T.White (Kalamazoo) MSC: 05C10 05C38 PDFBibTeX XMLCite \textit{G. Salazar}, J. Comb. Theory, Ser. B 76, No. 2, 129--135 (1999; Zbl 0935.05038) Full Text: DOI