Crossing-critical graphs with large maximum degree

DOI10.1016/j.jctb.2009.11.003zbMath1247.05066arXiv0907.1599OpenAlexW2083735231MaRDI QIDQ974468

Bojan Mohar, Zdeněk Dvořák

Publication date: 3 June 2010

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0907.1599

zbMATH Keywords

bandwidthcrossing numberedge crossingscrossing critical

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (6)

Bounded degree conjecture holds precisely for \(c\)-crossing-critical graphs with \(c \le 12\) ⋮ On the Pseudolinear Crossing Number ⋮ On degree properties of crossing-critical families of graphs ⋮ Unnamed Item ⋮ Structure and generation of crossing-critical graphs ⋮ Nested cycles in large triangulations and crossing-critical graphs

Cites Work

• Research problems from the 5th Slovenian Conference (Bled, 2003)
• New infinite families of almost-planar crossing-critical graphs
• Graph minors. V. Excluding a planar graph
• Crossing-number critical graphs have bounded path-width
• Embedding grids in surfaces
• Unexpected behaviour of crossing sequences

This page was built for publication: Crossing-critical graphs with large maximum degree