𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Multicolorings, measures and games on graphs

✍ Scribed by F.H Clarke; R.E Jamison

Publisher
Elsevier Science
Year
1976
Tongue
English
Weight
606 KB
Volume
14
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

List multicolorings of graphs with measu
List multicolorings of graphs with measurable sets
✍ A. J. W. Hilton; P. D. Johnson Jr. πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 175 KB

## Abstract In an ordinary list multicoloring of a graph, the vertices are β€œcolored” with subsets of pre‐assigned finite sets (called β€œlists”) in such a way that adjacent vertices are colored with disjoint sets. Here we consider the analog of such colorings in which the lists are measurable sets fr

Pursuitβ€”Evasion games on graphs
Pursuitβ€”Evasion games on graphs
✍ F. R. K. Chung; Joel E. Cohen; R. L. Graham πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 324 KB
Two-person games on graphs
Two-person games on graphs
✍ Alvin E Roth πŸ“‚ Article πŸ“… 1978 πŸ› Elsevier Science 🌐 English βš– 229 KB
On the Ramsey Problem for Multicolor Bip
On the Ramsey Problem for Multicolor Bipartite Graphs
✍ W.A Carnielli; E.L Monte Carmelo πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 85 KB

Given i, j positive integers, let K denote a bipartite complete graph and let i, j ## Ε½ . R m, n be the smallest integer a such that for any r-coloring of the edges of K r a, a one can always find a monochromatic subgraph isomorphic to K . In other m, n Ε½ . Γ„ 4 words, if a G R m, n then every mat