𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On irreducible no-hole L(2, 1)-coloring of trees

✍ Scribed by Renu C. Laskar; Gretchen L. Matthews; Beth Novick; John Villalpando

Book ID
102548005
Publisher
John Wiley and Sons
Year
2009
Tongue
English
Weight
92 KB
Volume
53
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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