Bounded degree conjecture holds precisely for \(c\)-crossing-critical graphs with \(c \le 12\)

DOI10.1007/s00493-021-4285-3OpenAlexW2922249263WikidataQ113904981 ScholiaQ113904981MaRDI QIDQ2678451

Zdeněk Dvořák, Drago Bokal, Tilo Wiedera, Petr Hliněný, Jesús Leaños, Bojan Mohar

Publication date: 23 January 2023

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-021-4285-3

zbMATH Keywords

crossing-critical graphsbounded degree conjecture

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

The crossing number of the generalized Petersen graph P(3k,k) in the projective plane

Cites Work

• Unnamed Item
• Nested cycles in large triangulations and crossing-critical graphs
• Infinite families of crossing-critical graphs with a given crossing number
• Minimal graphs with crossing number at least \(k\)
• Research problems from the 5th Slovenian Conference (Bled, 2003)
• Crossing-critical graphs with large maximum degree
• Construction of crossing-critical graphs
• Crossing-number critical graphs have bounded path-width
• On degree properties of crossing-critical families of graphs
• Embedding grids in surfaces
• Crossing number additivity over edge cuts
• Characterizing 2-crossing-critical graphs
• Infinite families of crossing-critical graphs with prescribed average degree and crossing number
• Stars and bonds in crossing-critical graphs
• ON THE ADDITIVITY OF CROSSING NUMBERS OF GRAPHS
• Crossing-Free Subgraphs
• An ILP-based Proof System for the Crossing Number Problem
• Crossing numbers of sequences of graphs II: Planar tiles
• Structure and generation of crossing-critical graphs