ON THE ADDITIVITY OF CROSSING NUMBERS OF GRAPHS

DOI10.1142/S0218216508006531zbMath1246.05043MaRDI QIDQ3542458

Jesús Leaños, Gelasio Salazar

Publication date: 1 December 2008

Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)

zbMATH Keywords

additivitycrossing-criticalCrossing numberszip product

Mathematics Subject Classification ID

Related Items (8)

Characterizing 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 ⋮ Crossing number additivity over edge cuts ⋮ On the crossing numbers of Cartesian products with trees ⋮ Unnamed Item ⋮ Infinite families of crossing-critical graphs with prescribed average degree and crossing number ⋮ Stars and bonds in crossing-critical graphs

Cites Work

• On the crossing numbers of Cartesian products with paths
• Crossing-number critical graphs have bounded path-width
• A successful concept for measuring non-planarity of graphs: The crossing number.
• The Minor Crossing Number

This page was built for publication: ON THE ADDITIVITY OF CROSSING NUMBERS OF GRAPHS