𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An infinite family of octahedral crossing numbers

✍ Scribed by Jonathan L. Gross

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Infinite families of biembedding numbers
Infinite families of biembedding numbers
✍ I. Anderson 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 244 KB

## Abstract Let __N__(γ, γ′) denote the size of the smallest complete graph that cannot be edge‐partitioned into two parts embeddable in closed orientable sufaces of genera γ, γ′, respectively. Well‐known embedding theorems are used to obtain several infinite families of values of __N__(γ, γ′). Som

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

An infinite family of biprimitive semisy
An infinite family of biprimitive semisymmetric graphs
✍ Du, Shao-Fei; Maru??i??, Dragan 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 296 KB 👁 1 views

A regular and edge-transitive graph that is not vertex-transitive is said to be semisymmetric. Every semisymmetric graph is necessarily bipartite, with the two parts having equal size and the automorphism group acting transitively on each of these two parts. A semisymmetric graph is called biprimiti

An infinite family of (simple) 6-designs
An infinite family of (simple) 6-designs
✍ Donald L. Kreher 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 193 KB 👁 1 views

A simple 6-(22,8,60) designs is exhibited. It is then shown using Qui-rong Wu's generalization of a result of Luc Teirlinck that this design together with our 6-(14,7,4) design implies the existence of simple 6-(23 + 16m,8,4(m + I) (16m + 17)) designs for all positive integers m. All the above ment

Constructing an Infinite Family of Cubic
Constructing an Infinite Family of Cubic 1-Regular Graphs
✍ Yan-Quan Feng; Jin Ho Kwak 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 89 KB

A graph is 1-regular if its automorphism group acts regularly on the set of its arcs. Miller [J. Comb. Theory, B, 10 (1971), 163-182] constructed an infinite family of cubic 1-regular graphs of order 2 p, where p ≥ 13 is a prime congruent to 1 modulo 3. Marušič and Xu [J. Graph Theory, 25 (1997), 13