✦ LIBER ✦

On the crossing number ofcm �cn

✍ Scribed by Salazar, Gelasio

Publisher: John Wiley and Sons
Year: 1998
Tongue: English
Weight: 75 KB
Volume: 28
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199807)28:3<163::aid-jgt6>3.0.co;2-i

No coin nor oath required. For personal study only.

✦ Synopsis

which has been proved only for m ≤ 6.

📜 SIMILAR VOLUMES

The crossing number ofC5 �Cn

✍ Kle??, Mari�n; Richter, R. Bruce; Stobert, Ian 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 276 KB

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.

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

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 __

On Line Graphs with Crossing Number 1

✍ V. R. Kulli; D. G. Akka; L. W. Beineke 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 159 KB

## Abstract In this paper we deduce a necessary and sufficient condition for a line grah to have crossing number 1. In addition, we prove that the line graph of any nonplanar graph has crossing number greater than 2.

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 improved upper bound on the crossing

An improved upper bound on the crossing number of the hypercube

✍ Luerbio Faria; Celina Miraglia Herrera de Figueiredo; Ondrej Sýkora; Imrich Vrt' 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 288 KB

## Abstract We draw the __n__‐dimensional hypercube in the plane with ${5\over 32}4^{n}-\lfloor{{{{n}^{2}+1}\over 2}}\rfloor {2}^{n-2}$ crossings, which improves the previous best estimation and coincides with the long conjectured upper bound of Erdös and Guy. © 2008 Wiley Periodicals, Inc. J Graph