𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The splitting number of complete bipartite graphs

✍ Scribed by B. Jackson; G. Ringel

Book ID
112620788
Publisher
Springer
Year
1984
Tongue
English
Weight
336 KB
Volume
42
Category
Article
ISSN
0003-889X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The maximal number of induced complete b
The maximal number of induced complete bipartite graphs
✍ BΓ©la BollobΓ‘s; ChiΓͺ Nara; Shun-ichi Tachibana πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 230 KB

The aim of this paper is to determine the maximal number of induced K(t, t) subgraphs in graphs of given order and in graphs of given size. Given a graph G and a natural number t, denote by ft(G) the number of induced subgraphs of G isomorphic to K(t, t). Our notation is that of ; in particular, K(

The splitting number of the complete gra
The splitting number of the complete graph
✍ Nora Hartsfield; Brad Jackson; Gerhard Ringel πŸ“‚ Article πŸ“… 1985 πŸ› Springer Japan 🌐 English βš– 743 KB
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