Mohar, Bojan From art and circuit design to geometry and combinatorics. (English) Zbl 1526.05105 Hujdurović, Ademir (ed.) et al., European congress of mathematics. Proceedings of the 8th congress, 8ECM, Portorož, Slovenia, June 20–26, 2021. Berlin: European Mathematical Society (EMS). 663-676 (2023). MSC: 05C62 52C10 PDFBibTeX XMLCite \textit{B. Mohar}, in: European congress of mathematics. Proceedings of the 8th congress, 8ECM, Portorož, Slovenia, June 20--26, 2021. Berlin: European Mathematical Society (EMS). 663--676 (2023; Zbl 1526.05105) Full Text: DOI
Bokal, Drago; Dvořák, Zdenĕk; Hlinĕny, Petr; Leaños, Jesús; Mohar, Bojan; Wiedera, Tilo Bounded degree conjecture holds precisely for \(c\)-crossing-critical graphs with \(c \le 12\). (English) Zbl 07644684 Combinatorica 42, No. 5, 701-728 (2022). MSC: 05C62 05C10 PDFBibTeX XMLCite \textit{D. Bokal} et al., Combinatorica 42, No. 5, 701--728 (2022; Zbl 07644684) Full Text: DOI
Bokal, Drago; Dvořák, Zdeněk; Hliněný, Petr; Leaños, Jesús; Mohar, Bojan; Wiedera, Tilo Bounded degree conjecture holds precisely for \(c\)-crossing-critical graphs with \(c\le 12\). (English) Zbl 07559214 Barequet, Gill (ed.) et al., 35th international symposium on computational geometry, SoCG 2019, Portland, Oregon, USA, June 18–21, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 129, Article 14, 15 p. (2019). MSC: 68U05 PDFBibTeX XMLCite \textit{D. Bokal} et al., LIPIcs -- Leibniz Int. Proc. Inform. 129, Article 14, 15 p. (2019; Zbl 07559214) Full Text: DOI arXiv
Dvořák, Zdeněk; Hliněný, Petr; Mohar, Bojan Structure and generation of crossing-critical graphs. (English) Zbl 1489.68190 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. LIPIcs – Leibniz Int. Proc. Inform. 99, Article 33, 14 p. (2018). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{Z. Dvořák} et al., LIPIcs -- Leibniz Int. Proc. Inform. 99, Article 33, 14 p. (2018; Zbl 1489.68190) Full Text: DOI arXiv
Á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 PDFBibTeX XMLCite \textit{B. M. Ábrego} et al., SIAM J. Discrete Math. 32, No. 4, 2482--2492 (2018; Zbl 1400.05061) Full Text: DOI arXiv
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 PDFBibTeX XMLCite \textit{C. A. Alfaro} et al., SIAM J. Discrete Math. 32, No. 3, 2080--2093 (2018; Zbl 1398.68383) 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.68382 Hu, Yifan (ed.) et al., Graph drawing and network visualization. 24th international symposium, GD 2016, Athens, Greece, September 19–21, 2016. Revised selected papers. Cham: Springer (ISBN 978-3-319-50105-5/pbk; 978-3-319-50106-2/ebook). Lecture Notes in Computer Science 9801, 427-438 (2016). MSC: 68R10 05C62 PDFBibTeX XMLCite \textit{C. A. Alfaro} et al., Lect. Notes Comput. Sci. 9801, 427--438 (2016; Zbl 1398.68382) Full Text: DOI arXiv
Mohar, Bojan; Stephen, Tamon Expected crossing numbers. (English) Zbl 1274.05106 Nešetřil, Jarik (ed.) et al., Extended abstracts of the sixth European conference on combinatorics, graph theory and applications, EuroComb 2011, Budapest, Hungary, August 29 – September 2, 2011. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 38, 651-656 (2011). MSC: 05C10 05C22 05C80 60C05 PDFBibTeX XMLCite \textit{B. Mohar} and \textit{T. Stephen}, Electron. Notes Discrete Math. 38, 651--656 (2011; Zbl 1274.05106) Full Text: Link
DeVos, Matt; Mohar, Bojan; Šámal, Robert Unexpected behaviour of crossing sequences. (English) Zbl 1234.05065 J. Comb. Theory, Ser. B 101, No. 6, 448-463 (2011). MSC: 05C10 05C62 PDFBibTeX XMLCite \textit{M. DeVos} et al., J. Comb. Theory, Ser. B 101, No. 6, 448--463 (2011; Zbl 1234.05065) Full Text: DOI arXiv
Cabello, Sergio; Mohar, Bojan Crossing number and weighted crossing number of near-planar graphs. (English) Zbl 1218.68083 Algorithmica 60, No. 3, 484-504 (2011). MSC: 68Q17 05C10 05C62 PDFBibTeX XMLCite \textit{S. Cabello} and \textit{B. Mohar}, Algorithmica 60, No. 3, 484--504 (2011; Zbl 1218.68083) Full Text: DOI
Dvořák, Zdeněk; Mohar, Bojan Crossing-critical graphs with large maximum degree. (English) Zbl 1247.05066 J. Comb. Theory, Ser. B 100, No. 4, 413-417 (2010). Reviewer: Dan S. Archdeacon (Burlington) MSC: 05C10 05C62 05C35 05C78 PDFBibTeX XMLCite \textit{Z. Dvořák} and \textit{B. Mohar}, J. Comb. Theory, Ser. B 100, No. 4, 413--417 (2010; Zbl 1247.05066) Full Text: DOI arXiv
Cabello, Sergio; Mohar, Bojan Crossing and weighted crossing number of near-planar graphs. (English) Zbl 1213.68432 Tollis, Ioannis G. (ed.) et al., Graph drawing. 16th international symposium, GD 2008, Heraklion, Crete, Greece, September 21–24, 2008. Revised papers. Berlin: Springer (ISBN 978-3-642-00218-2/pbk). Lecture Notes in Computer Science 5417, 38-49 (2009). MSC: 68R10 68U05 05C62 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{S. Cabello} and \textit{B. Mohar}, Lect. Notes Comput. Sci. 5417, 38--49 (2009; Zbl 1213.68432) Full Text: DOI