Bounded degree conjecture holds precisely for c-crossing-critical graphs with c 12
From MaRDI portal
Publication:5088941
DOI10.4230/LIPICS.SOCG.2019.14MaRDI QIDQ5088941FDOQ5088941
Authors: Drago Bokal, Zdeněk Dvořák, Petr Hliněný, Bojan Mohar, Tilo Wiedera, J. Leaños 
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1903.05363
Recommendations
Cites Work
- Crossing-Free Subgraphs
- Characterizing 2-crossing-critical graphs
- An ILP-based Proof System for the Crossing Number Problem
- Construction of crossing-critical graphs
- Crossing-number critical graphs have bounded path-width
- Infinite families of crossing-critical graphs with prescribed average degree and crossing number
- Nested cycles in large triangulations and crossing-critical graphs
- Crossing-critical graphs with large maximum degree
- Research problems from the 5th Slovenian Conference (Bled, 2003)
- Structure and generation of crossing-critical graphs
- Crossing number additivity over edge cuts
- ON THE ADDITIVITY OF CROSSING NUMBERS OF GRAPHS
- On degree properties of crossing-critical families of graphs
Cited In (6)
- Properties of large 2-crossing-critical graphs
- On 13-crossing-critical graphs with arbitrarily large degrees
- On the achievable average degrees in 2-crossing-critical graphs
- Domination and independence number of large 2-crossing-critical graphs
- Improvement on the Crossing Number of Crossing-Critical Graphs
- Improvement on the crossing number of crossing-critical graphs
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 Q5088941)
