𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The minimum diameter of orientations of complete multipartite graphs

✍ Scribed by K. M. Koh; B. P. Tan

Publisher
Springer Japan
Year
1996
Tongue
English
Weight
379 KB
Volume
12
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The diameter of an orientation of a comp
The diameter of an orientation of a complete multipartite graph
✍ K.M. Koh; B.P. Tan πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 390 KB

For a graph G, let e(G) denote the minimum value of the diameters diamD of D, where D runs through all the orientations of G. In this paper, we obtain some results on e(G) for complete multipartite graphs G, which extend some known results due to Boesch and Tindell [1] and Maurer [4].

On minimum sets of 1-factors covering a
On minimum sets of 1-factors covering a complete multipartite graph
✍ David Cariolaro; Hung-Lin Fu πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 132 KB πŸ‘ 1 views

## Abstract We determine necessary and sufficient conditions for a complete multipartite graph to admit a set of 1‐factors whose union is the whole graph and, when these conditions are satisfied, we determine the minimum size of such a set. Β© 2008 Wiley Periodicals, Inc. J Graph Theory 58:239‐250,

The chromatic index of complete multipar
The chromatic index of complete multipartite graphs
✍ D. G. Hoffman; C. A. Rodger πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 266 KB

## Abstract We show that a complete multipartite graph is class one if and only if it is not eoverfull, thus determining its chromatic index.