✦ LIBER ✦

The crossing number of the complement of a circuit

✍ Scribed by Richard K. Guy; Anthony Hill

Publisher: Elsevier Science
Year: 1973
Tongue: English
Weight: 922 KB
Volume: 5
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(73)90127-1

No coin nor oath required. For personal study only.

✦ Synopsis

Upper and lower bounds for the crossing number of the graph formed by deletion of a hamilton circuit from the complete graph on n vertices are obtained, with exact values for n 5 10 and for the rectilinear crossing number for n 5 9.

📜 SIMILAR VOLUMES

The book crossing number of a graph

✍ Shahrokhi, Farhad; Sz�kely, L�szl� A.; S�kora, Ondrej; Vrt'o, Imrich 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 581 KB

Let G be a graph on n vertices and m edges. The book crossing number of G is defined as the minimum number of edge crossings when the vertices of G are placed on the spine of a k-page book and edges are drawn on pages, such that each edge is contained by one page. Our main results are t w o polynomi

Bounding the crossing number of a graph

Bounding the crossing number of a graph in terms of the crossing number of a minor with small maximum degree

✍ Enrique Garcia-Moreno; Gelasio Salazar 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 76 KB 👁 3 views

The crossing number of c4 × c4

✍ Alice M. Dean; R. Bruce Richter 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB

We prove t h a t t h e crossing number of C4 X Ca is 8.

An improvement of the crossing number bo

An improvement of the crossing number bound

✍ Bernard Montaron 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB

## Abstract The crossing number __cr__(__G__) of a simple graph __G__ with __n__ vertices and __m__ edges is the minimum number of edge crossings over all drawings of __G__ on the ℝ^2^ plane. The conjecture made by Erdős in 1973 that __cr__(__G__) ≥ __Cm__^3^/__n__^2^ was proved in 1982 by Leighton

The Crossing Number of P(N, 3)

✍ R. Bruce Richter; Gelasio Salazar 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 166 KB

On the Crossing Number of Complete Graph

On the Crossing Number of Complete Graphs

✍ O. Aichholzer; F. Aurenhammer; H. Krasser 📂 Article 📅 2005 🏛 Springer Vienna 🌐 English ⚖ 135 KB