𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Covering Complete r-Graphs with Spanning Complete r-Partite r-Graphs

✍ Scribed by CIOABĂ, SEBASTIAN M.; KÜNDGEN, ANDRÉ; TIMMONS, CRAIG M.; VYSOTSKY, VLADISLAV V.

Book ID
120309535
Publisher
Cambridge University Press
Year
2011
Tongue
English
Weight
563 KB
Volume
20
Category
Article
ISSN
0963-5483

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

r-Regular, r-connected decompositions of
r-Regular, r-connected decompositions of complete graphs
✍ H. Fleischner; W. R. Johnstone; A. J. W. Hilton 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB 👁 2 views

If rjn À 1 and rn is even, then K n can be expressed as the union of t nÀ1 r edgedisjoint isomorphic r-regular r-connected factors.

Two characterizations of interchange gra
Two characterizations of interchange graphs of complete m-partite graphs
✍ Curtis R. Cook 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 564 KB

A graph G is m-partite if its points can be partitioned into m subsets Yl, . . . . Vm such that every line joins a point in Vi with a point in Vi, i + j. A complete m-partite graph contains every line joining Vi with V-. A complete graph Kp has every pair of its p points adjacent. The nth interchang