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

On the choosability of complete multipartite graphs with part size three

โœ Scribed by H.A. Kierstead

Book ID
108316385
Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
70 KB
Volume
211
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

On the size of graphs with complete-fact
On the size of graphs with complete-factors
โœ Jin Akiyama; Peter Frankl ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 188 KB ๐Ÿ‘ 1 views
On the number of edge-disjoint one facto
On the number of edge-disjoint one factors and the existence of k-factors in complete multipartite graphs
โœ D.G. Hoffman; C.A. Rodger ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 503 KB

In this paper we use Tutte's f-factor theorem and the method of amalgamations to find necessary and sufficient conditions for the existence of a k-factor in the complete multipartite graph K(p(1 ) ..... p(n)), conditions that are reminiscent of the Erd6s-Gallai conditions for the existence of simple