Minimal graphs with crossing number at least \(k\)

DOI10.1006/jctb.1993.1038zbMath0733.05035OpenAlexW2006582264MaRDI QIDQ810038

R. Bruce Richter, Carsten Thomassen

Publication date: 1993

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

Full work available at URL: https://doi.org/10.1006/jctb.1993.1038

zbMATH Keywords

crossing number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (20)

Improvement on the decay of crossing numbers ⋮ Stars and Bonds in Crossing-Critical Graphs ⋮ On the Decay of Crossing Numbers of Sparse Graphs ⋮ The crossing number of \(K_{5,n+1} \setminus e\) ⋮ New upper bounds for the crossing numbers of crossing-critical graphs ⋮ On 3‐regular graphs having crossing number at least 2 ⋮ Bounded degree conjecture holds precisely for \(c\)-crossing-critical graphs with \(c \le 12\) ⋮ Crossing-number critical graphs have bounded path-width ⋮ Infinite families of crossing-critical graphs with given average degree ⋮ Characterizing all graphs with 2-exceptional edges ⋮ On degree properties of crossing-critical families of graphs ⋮ On the decay of crossing numbers ⋮ Infinite families of crossing-critical graphs with prescribed average degree and crossing number ⋮ Improvement on the Decay of Crossing Numbers ⋮ Stars and bonds in crossing-critical graphs ⋮ Nested cycles in large triangulations and crossing-critical graphs ⋮ On a crossing number result of Richter and Thomassen ⋮ Drawings of \(C_m\times C_n\) with one disjoint family ⋮ Improvement on the Crossing Number of Crossing-Critical Graphs ⋮ Improvement on the crossing number of crossing-critical graphs

This page was built for publication: Minimal graphs with crossing number at least \(k\)