✦ LIBER ✦

The achromatic indices of the regular complete multipartite graphs

✍ Scribed by Nam-Po Chiang; Hung-Lin Fu

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 272 KB
Volume: 141
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)e0207-k

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, we study the achromatic indices of the regular complete multipartite graphs and obtain the following results:

(1) A good upper bound for the achromatic index of the regular complete multipartite graph which gives the exact values of an infinite family of graphs and solves a problem posed by Bouchet.

(2) An improved Bouchet coloring which gives the achromatic indices of another infinite family of regular complete multipartite graphs.

📜 SIMILAR VOLUMES

The star-arboricity of the complete regu

The star-arboricity of the complete regular multipartite graphs

✍ Yasukazu Aoki 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 331 KB

A subgraph H of a graph G is called a star-subgraph if each component of H is a star. The star-arboricify of G, denoted by sa(G), is the minimum number of star-subgraphs that partition the edges of G. In this paper we show that sa(G) is [r/21 + 1 or [r/2] + 2 for the complete r-regular multipartite

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.

On the euclidean dimension of a complete

On the euclidean dimension of a complete multipartite graph

✍ Hiroshi Maehara 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 272 KB

The euclidean dimension of a graph G, e(G), is the minimum n such that the vertices of G can be placed in euclidean n-space, R", in such a way that adjacent vertices have distance 1 and nonadjacent vertices have distances other than 1. Let G = K(n,, . , ns+,+J be a complete (s + t + u)-partite graph

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].

l-Regular rotations of the countably inf

l-Regular rotations of the countably infinite complete graph

✍ Mark Jungerman 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 998 KB

## All WWV . I-regular rotation of the infinite complete graph with countable vertex set is one in induced circuit is finite of kngth 1. I-regular rotations are exhibited for all 1 a 3. which Triangular rotations of finite graphs have been extensively studied. In particular, finding such rotation

On the Number of Nonisomorphic Orientabl

On the Number of Nonisomorphic Orientable Regular Embeddings of Complete Graphs

✍ Vladimir P. Korzhik; Heinz-Jurgen Voss 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 260 KB

In this paper we consider those 2-cell orientable embeddings of a complete graph K n+1 which are generated by rotation schemes on an abelian group 8 of order n+1, where a rotation scheme an 8 is defined as a cyclic permutation ( ; 1 , ; 2 , ..., ; n ) of all nonzero elements of 8. It is shown that t