𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some coloring numbers for complete r-partite graphs

✍ Scribed by Bruce Auerbach; Renu Laskar

Book ID
107884057
Publisher
Elsevier Science
Year
1976
Tongue
English
Weight
104 KB
Volume
21
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Q-integral complete r-partite graphs
Q-integral complete r-partite graphs
✍ Guopeng Zhao; Ligong Wang; Ke Li πŸ“‚ Article πŸ“… 2013 πŸ› Elsevier Science 🌐 English βš– 297 KB
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 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