✦ LIBER ✦

A Lower Bound for the Rectilinear Crossing Number

✍ Scribed by Bernardo M. Ábrego; Silvia Fernández-Merchant

Publisher: Springer Japan
Year: 2005
Tongue: English
Weight: 107 KB
Volume: 21
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-005-0612-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounds for rectilinear crossing numbers

✍ Daniel Bienstock; Nathaniel Dean 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 780 KB

## Abstract A rectilinear drawing of a graph is one where each edge is drawn as a straight‐line segment, and the rectilinear crossing number of a graph is the minimum number of crossings over all rectilinear drawings. We describe, for every integer __k__ ≥ 4, a class of graphs of crossing number __

New Lower Bounds for the Number of (≤ k)

New Lower Bounds for the Number of (≤ k)-Edges and the Rectilinear Crossing Number of Kn

✍ Oswin Aichholzer; Jesus Garcia; David Orden; Pedro Ramos 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 213 KB

A lower bound for the crossing number of

A lower bound for the crossing number of Cm × Cn

✍ Gelasio Salazar 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 67 KB 👁 3 views

An upper bound for the rectilinear cross

An upper bound for the rectilinear crossing number of the complete graph

✍ H.F Jensen 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 195 KB

Lower bounds for rectilinear Steiner tre

Lower bounds for rectilinear Steiner trees in bounded space

✍ Timothy Law Snyder 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 438 KB

A note on lower bounds for rectilinear S

A note on lower bounds for rectilinear Steiner trees

✍ J.S. Salowe 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 98 KB