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

Multi-Color Pebble Motion on Graphs

โœ Scribed by Gilad Goraly; Refael Hassin

Book ID
106149012
Publisher
Springer
Year
2009
Tongue
English
Weight
628 KB
Volume
58
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Colored pebble motion on graphs
Colored pebble motion on graphs
โœ Shinya Fujita; Tomoki Nakamigawa; Tadashi Sakuma ๐Ÿ“‚ Article ๐Ÿ“… 2012 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 263 KB
A Note on Graph Pebbling
A Note on Graph Pebbling
โœ Andrzej Czygrinow; Glenn Hurlbert; H.A. Kierstead; William T. Trotter ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Springer Japan ๐ŸŒ English โš– 110 KB
Optimal Pebble Motion on a Tree
Optimal Pebble Motion on a Tree
โœ Vincenzo Auletta; Pino Persiano ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 263 KB
Multi-coloring the Mycielskian of graphs
Multi-coloring the Mycielskian of graphs
โœ Wensong Lin; Daphne Der-Fen Liu; Xuding Zhu ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 129 KB

## Abstract A __k__โ€fold coloring of a graph is a function that assigns to each vertex a set of __k__ colors, so that the color sets assigned to adjacent vertices are disjoint. The __k__th chromatic number of a graph __G__, denoted by ฯ‡~__k__~(__G__), is the minimum total number of colors used in a