An improved lower bound for crossing numbers

DOI10.1007/3-540-45848-4_8MaRDI QIDQ3043708zbMATH OpenFDO

Authors Hristo N. Djidjev, Imrich Vrt'o

Publication date 6 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2265/22650096.htm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Crossing Numbers and Cutwidths
• Crossing number, pair-crossing number, and expansion
• Improved upper bounds on the crossing number
• Crossing numbers of imbalanced graphs
• Crossing number for graphs with bounded pathwidth

Cited in

(8)

• Upper bounds for ropelength as a function of crossing number.
• A new lower bound for the bipartite crossing number with applications
• Crossing number, pair-crossing number, and expansion
• Bounds for Convex Crossing Numbers
• Improved upper bounds on the crossing number
• scientific article; zbMATH DE number 1054768 (Why is no real title available?)
• scientific article; zbMATH DE number 2061148 (Why is no real title available?)
• Crossing Numbers and Cutwidths

This page was built for publication: An improved lower bound for crossing numbers

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