𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the page number of complete odd-partite graphs

✍ Scribed by Sperfeld, Konrad

Book ID
120370423
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
504 KB
Volume
313
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Total chromatic number of complete r-par
Total chromatic number of complete r-partite graphs
✍ K. H. Chew; H. P. Yap πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 284 KB πŸ‘ 1 views

## Abstract Rosenfeld (1971) proved that the Total Colouring Conjecture holds for balanced complete __r__‐partite graphs. Bermond (1974) determined the exact total chromatic number of every balanced complete __r__‐partite graph. Rosenfeld's result had been generalized recently to complete __r__‐par

On the asymptotic value of the choice nu
On the asymptotic value of the choice number of complete multi-partite graphs
✍ Nurit Gazit; Michael Krivelevich πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 144 KB πŸ‘ 1 views

## Abstract We calculate the asymptotic value of the choice number of complete multi‐partite graphs, given certain limitations on the relation between the sizes of the different sides. In the bipartite case, we prove that if __n__~0~ ≀ __n__~1~ and log__n__~0~ ≫ loglog__n__~1~, then $ch(K\_{n\_{0},

On the line graphs of the complete r-par
On the line graphs of the complete r-partite graphs
✍ Peter ZΓΆrnig πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 184 KB

We show that the connectivities of line graphs of multipartite graphs equal the minimum valency. ## I. Introduction In order to solve degeneracy problems in linear optimization the so-called degeneracy graphs, assigned to a degenerate vertex x of the feasible solution set, have proved to be usefu