𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Rotation numbers for unions of circuits

✍ Scribed by Béla Bollobás; E. J. Cockayne; Fang Zu Yao

Publisher
John Wiley and Sons
Year
1984
Tongue
English
Weight
467 KB
Volume
8
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Ramsey numbers for disjoint unions o
The Ramsey numbers for disjoint unions of cycles
✍ Tristan Denley 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 671 KB

As usual, for simple graphs G and H, let the Ramsey number r(G,H) be defined as the least number n such that for any graph K of order n, either G is a subgraph of K or H is a subgraph of/(. We shall establish the values of r(aC~,bCs) and r(aCv, bC7) almost precisely (where nG is the graph consisting

More rotation numbers for complete bipar
More rotation numbers for complete bipartite graphs
✍ Béla Bollobás; E. J. Cockayne 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 285 KB

## Abstract Let __G__ be a simple undirected graph which has __p__ vertices and is rooted at __x__. Informally, the __rotation number h(G, x)__ of this rooted graph is the minimum number of edges in a __p__ vertex graph __H__ such that for each vertex __v__ of __H__, there exists a copy of __G__ in