𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Infinite families of crossing-critical graphs with a given crossing number

✍ Scribed by Jozef Širáň

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
192 KB
Volume
48
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Infinite families of crossing-critical g
Infinite families of crossing-critical graphs with prescribed average degree and crossing number
✍ Drago Bokal 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 242 KB 👁 1 views

## Abstract Širáň constructed infinite families of __k__‐crossing‐critical graphs for every __k__⩾3 and Kochol constructed such families of simple graphs for every __k__⩾2. Richter and Thomassen argued that, for any given __k__⩾1 and __r__⩾6, there are only finitely many simple __k__‐crossing‐criti

The book crossing number of a graph
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

Nonseparable graphs with a given number
Nonseparable graphs with a given number of cycles
✍ Ranko Šćepanović; Gerhard Ringel; Dragan Marušič; G. L. Chia; Brian Alspach 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 646 KB

## Abstract G. Ringel conjectured that for every positive integer __n__ other than 2, 4, 5, 8, 9, and 16, there exists a nonseparable graph with __n__ cycles. It is proved here that the conjecture is true even with the restriction to planar and hamiltonian graphs.