𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The crossing number ofC5 �Cn

✍ Scribed by Kle??, Mari�n; Richter, R. Bruce; Stobert, Ian

Publisher
John Wiley and Sons
Year
1996
Tongue
English
Weight
276 KB
Volume
22
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

We prove that the crossing number of C5 x C, is 372, which is consistent with the general conjecture that the crossing number of C,, x C, is ( m -2)n, for 3 5 m 5 n.

📜 SIMILAR VOLUMES

On the crossing number ofcm �cn
On the crossing number ofcm �cn
✍ Salazar, Gelasio 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 75 KB

which has been proved only for m ≤ 6.

The crossing number of Cm × Cn is as con
The crossing number of Cm × Cn is as conjectured for n ≥ m(m + 1)
✍ Lev Yu. Glebsky; Gelasio Salazar 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 168 KB 👁 1 views

## Abstract It has been long conjectured that the crossing number of __C~m~__ × __C~n~__ is (__m__−2)__n__, for all __m__, __n__ such that __n__ ≥  __m__ ≥  3. In this paper, it is shown that if __n__ ≥  __m__(__m__ + 1) and __m__ ≥  3, then this conjecture holds. That is, the crossing number of __

The crossing number of c4 × c4
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 book crossing number of a graph
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