✦ LIBER ✦

The crossing number ofK3,n in a surface

✍ Scribed by Richter, R. Bruce; ?ir�?, J.

Publisher: John Wiley and Sons
Year: 1996
Tongue: English
Weight: 174 KB
Volume: 21
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199601)21:1<51::aid-jgt7>3.0.co;2-l

No coin nor oath required. For personal study only.

✦ Synopsis

In this article, w e show that the crossing number of K3," in a surface with Euler genus

. This generalizes a result of Guy and Jenkyns, who obtained this result for the torus. 0

📜 SIMILAR VOLUMES

The crossing number of K1,3,n and K2,3,n

✍ Kouhei Asano 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 234 KB

In this article, we will determine the crossing number of the complete tripartite graphs K,.3.n and K2,3.n. Our proof depends on Kleitman's results for the complete bipartite graphs [D. J. Kleitman, The crossing number of K5,n. J. Combhatorial Theory 9 (1970) 375-3231. a graph G is the minimum numbe

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.

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 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

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 a Graph on a Comp

The Crossing Number of a Graph on a Compact 2-Manifold

✍ F. Shahrokhi; O. Sýkora; L.A. Székely; I. Vrťo 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 478 KB

We introduce a general framework to estimate the crossing number of a graph on a compact 2-manifold in terms of the crossing number of the complete graph of the same size on the same manifold. The bounds are tight within a constant multiplicative factor for many graphs, including hypercubes, some co