Bounded degree conjecture holds precisely for c-crossing-critical graphs with c 12
From MaRDI portal
Publication:2678451
Recommendations
Cites work
- An ILP-based Proof System for the Crossing Number Problem
- Characterizing 2-crossing-critical graphs
- Construction of crossing-critical graphs
- Crossing number additivity over edge cuts
- Crossing numbers of sequences of graphs II: Planar tiles
- Crossing-critical graphs with large maximum degree
- Crossing-Free Subgraphs
- Crossing-number critical graphs have bounded path-width
- Embedding grids in surfaces
- Graphs on surfaces
- Infinite families of crossing-critical graphs with a given crossing number
- Infinite families of crossing-critical graphs with prescribed average degree and crossing number
- Minimal graphs with crossing number at least \(k\)
- Nested cycles in large triangulations and crossing-critical graphs
- On degree properties of crossing-critical families of graphs
- ON THE ADDITIVITY OF CROSSING NUMBERS OF GRAPHS
- Research problems from the 5th Slovenian Conference (Bled, 2003)
- Stars and bonds in crossing-critical graphs
- Structure and generation of crossing-critical graphs
Cited in
(5)- Bounded degree conjecture holds precisely for c-crossing-critical graphs with c 12
- The crossing number of the generalized Petersen graph P(3k,k) in the projective plane
- On 13-crossing-critical graphs with arbitrarily large degrees
- A systematic approach to crossing numbers of Cartesian products with paths
- A systematic approach to crossing numbers of Cartesian products with paths
This page was built for publication: Bounded degree conjecture holds precisely for \(c\)-crossing-critical graphs with \(c \le 12\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2678451)