𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Pfaffian graphs,T-joins and crossing numbers

✍ Scribed by Serguei Norine

Publisher
Springer-Verlag
Year
2008
Tongue
English
Weight
202 KB
Volume
28
Category
Article
ISSN
0209-9683

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 _

Crossing numbers of sequences of graphs
Crossing numbers of sequences of graphs II: Planar tiles
✍ Benny Pinontoan; R. Bruce Richter 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB

## Abstract We describe a method of creating an infinite family of crossing‐critical graphs from a single small planar map, the __tile__, by gluing together many copies of the tile together in a circular fashion. This method yields all known infinite families of __k__‐crossing‐critical graphs. Furt

T-joins intersecting small edge-cuts in
T-joins intersecting small edge-cuts in graphs
✍ Tomáš Kaiser; Riste Škrekovski 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB

## Abstract In an earlier paper 3, we studied cycles in graphs that intersect all edge‐cuts of prescribed sizes. Passing to a more general setting, we examine the existence of __T__‐joins in grafts that intersect all edge‐cuts whose size is in a given set __A__ ⊆{1,2,3}. In particular, we character

On stable crossing numbers
On stable crossing numbers
✍ Paul C. Kainen; Arthur T. White 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 253 KB

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