An optimality criterion for the crossing number

DOI10.26493/1855-3974.43.506zbMATH Open1179.05037OpenAlexW1934271741WikidataQ129351782 ScholiaQ129351782MaRDI QIDQ3535840FDOQ3535840

Authors: László A. Székely 

Publication date: 14 November 2008

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.43.506

Recommendations

• Which crossing number is it anyway?
• Some provably hard crossing number problems
• Do we really understand the crossing numbers?
• Graph Drawing
• Crossing numbers

zbMATH Keywords

graph drawingintersectionscrossing numbercorrelation inequality

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Cited In (5)

• Crossing numbers of graphs with rotation systems
• Title not available (Why is that?)
• Adjacent Crossings Do Matter
• On the Maximum Crossing Number
• Domination and independence number of large 2-crossing-critical graphs

This page was built for publication: An optimality criterion for the crossing number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3535840)