On the sharpness of some results relating cuts and crossing numbers

zbMath1230.05106MaRDI QIDQ986698

Laurent Beaudou, Drago Bokal

Publication date: 12 August 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/232688

zbMATH Keywords

connectivity condition

Mathematics Subject Classification ID

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

Related Items (3)

Characterizing 2-crossing-critical graphs ⋮ Crossing number additivity over edge cuts ⋮ The crossing number of the Cartesian product of paths with complete graphs

This page was built for publication: On the sharpness of some results relating cuts and crossing numbers