Infinite families of crossing-critical graphs with prescribed average degree and crossing number

DOI10.1002/jgt.20470zbMath1226.05094arXiv0909.2561MaRDI QIDQ3055931

Drago Bokal

Publication date: 10 November 2010

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

graph; crossing number; average degree; critical graph; crossing-critical graph

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C10: Planar graphs; geometric and topological aspects of graph theory

Related Items

Characterizing all graphs with 2-exceptional edges, Unnamed Item, Structure and generation of crossing-critical graphs, Nested cycles in large triangulations and crossing-critical graphs, On degree properties of crossing-critical families of graphs, The crossing number of \(K_{5,n+1} \setminus e\), Crossing number additivity over edge cuts, Characterizing 2-crossing-critical graphs, Bounded degree conjecture holds precisely for \(c\)-crossing-critical graphs with \(c \le 12\)

Cites Work

• Unnamed Item
• Unnamed Item
• Crossing-critical edges and Kuratowski subgraphs of a graph
• 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
• Construction of crossing-critical graphs
• Infinite families of crossing-critical graphs with given average degree
• On a crossing number result of Richter and Thomassen
• Embedding grids in surfaces
• Characterizing 2-crossing-critical graphs
• Nearly light cycles in embedded graphs and crossing-critical graphs
• ON THE ADDITIVITY OF CROSSING NUMBERS OF GRAPHS
• Crossing numbers of sequences of graphs II: Planar tiles
• On the crossing numbers of Cartesian products with trees
• The crossing number of K5,n