Construction of crossing-critical graphs

DOI10.1016/0012-365X(87)90108-7zbMath0618.05021OpenAlexW2056837081MaRDI QIDQ1088998

Martin Kochol

Publication date: 1987

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(87)90108-7

zbMATH Keywords

crossing numbercrossing-critical graphs

Mathematics Subject Classification ID

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

Related Items (17)

Characterizing 2-crossing-critical graphs ⋮ Stars and Bonds in Crossing-Critical Graphs ⋮ Properties of Large 2-Crossing-Critical Graphs ⋮ Deciding Parity of Graph Crossing Number ⋮ Bounded degree conjecture holds precisely for \(c\)-crossing-critical graphs with \(c \le 12\) ⋮ Crossing-number critical graphs have bounded path-width ⋮ Domination and independence number of large 2-crossing-critical graphs ⋮ Infinite families of crossing-critical graphs with given average degree ⋮ Crossing number additivity over edge cuts ⋮ Characterizing all graphs with 2-exceptional edges ⋮ On degree properties of crossing-critical families of graphs ⋮ Unnamed Item ⋮ Structure and generation of crossing-critical graphs ⋮ Infinite families of crossing-critical graphs with prescribed average degree and crossing number ⋮ Stars and bonds in crossing-critical graphs ⋮ Nested cycles in large triangulations and crossing-critical graphs ⋮ Graphs with at most one crossing

Cites Work

• Infinite families of crossing-critical graphs with a given crossing number
• Planarity and duality of finite and infinite graphs
• Parallel concepts in graph theory
• On stable crossing numbers
• Crossing Number Problems

This page was built for publication: Construction of crossing-critical graphs