On degree properties of crossing-critical families of graphs

zbMath1409.05066MaRDI QIDQ1733938

Petr Hliněný, Drago Bokal, Marek Derňár, Mojca Bračič

Publication date: 22 March 2019

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v26i1p53

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (4)

Properties of Large 2-Crossing-Critical Graphs ⋮ Bounded degree conjecture holds precisely for \(c\)-crossing-critical graphs with \(c \le 12\) ⋮ Domination and independence number of large 2-crossing-critical graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• 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\)
• On the crossing numbers of Cartesian products with paths
• Crossing-critical graphs with large maximum degree
• Construction of crossing-critical graphs
• Crossing-number critical graphs have bounded path-width
• Infinite families of crossing-critical graphs with given average degree
• 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
• Crossing-Free Subgraphs
• Crossing numbers of sequences of graphs II: Planar tiles

This page was built for publication: On degree properties of crossing-critical families of graphs