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

No-hole (r+1)-distant colorings

โœ Scribed by Denise Sakai; Chi Wang

Book ID
103056289
Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
960 KB
Volume
119
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Minimum Span of No-Hole ( r +1)-Distant
Minimum Span of No-Hole ( r +1)-Distant Colorings
โœ Chang, Gerard J.; Juan, Justie Su-tzu; Liu, Daphne Der-Fen ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 169 KB
No-hole 2-distant colorings
No-hole 2-distant colorings
โœ Fred S. Roberts ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 571 KB
No-hole L(2,1)-colorings
No-hole L(2,1)-colorings
โœ Peter C. Fishburn; Fred S. Roberts ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 137 KB

An L(2; 1)-coloring of a graph G is a coloring of G's vertices with integers in {0; 1; : : : ; k} so that adjacent vertices' colors di er by at least two and colors of distance-two vertices di er. We refer to an L(2; 1)-coloring as a coloring. The span (G) of G is the smallest k for which G has a co

On irreducible no-hole L(2, 1)-coloring
On irreducible no-hole L(2, 1)-coloring of trees
โœ Renu C. Laskar; Gretchen L. Matthews; Beth Novick; John Villalpando ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 92 KB