𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On stable crossing numbers

✍ Scribed by Paul C. Kainen; Arthur T. White

Publisher
John Wiley and Sons
Year
1978
Tongue
English
Weight
253 KB
Volume
2
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Results giving the exact crossing number of an infinite family of graphs on some surface are very scarce. In this paper we show the following: for G = Q~n~ × K~4.4~, cr~y(G)‐m~(G) = 4__m__, for 0 ⩽ = m ⩽ 2^n^. A generalization is obtained, for certain repeated cartesian products of bipartite graphs. Nonorientable analogs are also developed.

📜 SIMILAR VOLUMES

Crossing numbers of imbalanced graphs
Crossing numbers of imbalanced graphs
✍ János Pach; József Solymosi; Gábor Tardos 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 103 KB

## Abstract The __crossing number__, cr(__G__), of a graph __G__ is the least number of crossing points in any drawing of __G__ in the plane. According to the Crossing Lemma of M. Ajtai, V. Chvátal, M. Newborn, E. Szemerédi, Theory and Practice of Combinatorics, North‐Holland, Amsterdam, New York,

On the crossing numbers of Cartesian pro
On the crossing numbers of Cartesian products with trees
✍ Drago Bokal 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB

## Abstract Zip product was recently used in a note establishing the crossing number of the Cartesian product __K__~1~,__n__ □ __P__~m~. In this article, we further investigate the relations of this graph operation with the crossing numbers of graphs. First, we use a refining of the embedding metho

Crossing numbers of Sierpiński-like grap
Crossing numbers of Sierpiński-like graphs
✍ Sandi Klavžar; Bojan Mohar 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB

## Abstract Crossing numbers of Sierpiński graphs __S__(__n__,__k__) and their regularizations __S__^+^(__n__,__k__) and __S__^++^(__n__,__k__) are studied. Drawings of these graphs are presented and proved to be optimal for __S__^+^(__n__,__k__) and __S__^++^(__n__,__k__) for every __n__ ≥ 1 and _