๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The Chromaticity of Certain Complete Multipartite Graphs

โœ Scribed by Haixing Zhao; Xueliang Li; Ruying Liu; Chengfu Ye

Publisher
Springer Japan
Year
2004
Tongue
English
Weight
322 KB
Volume
20
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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.

The chromaticity of certain graphs with
The chromaticity of certain graphs with five triangles
โœ Nian-Zu Li; Earl Glen Whitehead Jr ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 397 KB

Let W(n, k) denote the graph of order n obtained from the wheel I+', by deleting all but k consecutive spokes. In this note, we study the chromaticity of graphs which share certain properties of U'(n, 6) which can be obtained from the coeffictents of the chromatic polynomial of W(n, 6). In particula

Fair Hamilton Decompositions of Complete
Fair Hamilton Decompositions of Complete Multipartite Graphs
โœ C.D. Leach; C.A. Rodger ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 88 KB

A fair hamilton decomposition of the complete multipartite graph G is a set of hamilton cycles in G whose edges partition the edges of G in such a way that, for each pair of parts and for each pair of hamilton cycles H 1 and H 2 , the difference in the number of edges in H 1 and H 2 joining vertices