𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Quasi-total graphs with crossing numbers

✍ Scribed by Basavanagoud, B.

Book ID
127241280
Publisher
Informa UK (Taylor & Francis)
Year
1998
Tongue
English
Weight
380 KB
Volume
1
Category
Article
ISSN
0972-0529

No coin nor oath required. For personal study only.

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

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 _