An improved bound for the crossing number of \(C_m\times C_n\): a self-contained proof using mostly combinatorial arguments

DOI10.1007/S00373-003-0549-5zbMath1053.05037OpenAlexW2004255417MaRDI QIDQ1889832

Gelasio Salazar, Edgoardo Ugalde

Publication date: 13 December 2004

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-003-0549-5

zbMATH Keywords

crossing number

Mathematics Subject Classification ID

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

Related Items (2)

Orthogonal drawings and crossing numbers of the Kronecker product of two cycles ⋮ A survey of graphs with known or bounded crossing numbers

This page was built for publication: An improved bound for the crossing number of \(C_m\times C_n\): a self-contained proof using mostly combinatorial arguments