✦ LIBER ✦

Full Color Theorems for L(2,1)-Colorings

✍ Scribed by Fishburn, Peter C.; Roberts, Fred S.

Book ID: 118197198
Publisher: Society for Industrial and Applied Mathematics
Year: 2006
Tongue: English
Weight: 226 KB
Volume: 20
Category: Article
ISSN: 0895-4801
DOI: 10.1137/s0895480100378562

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Full-color future for t.v.

📂 Article 📅 1979 🏛 The Institution of Electrical Engineers ⚖ 263 KB

MATERIALS FOR FULL-COLOR ELECTROLUMINESC

MATERIALS FOR FULL-COLOR ELECTROLUMINESCENT DISPLAYS

✍ Ono, Yoshimasa A. 📂 Article 📅 1997 🏛 Annual Reviews 🌐 English ⚖ 219 KB

2 × 2 FULL COLOR BIRD SLIDES AVAILABLE

📂 Article 📅 1946 🏛 School Science and Mathematics Association 🌐 English ⚖ 50 KB

Basis theorems for continuous n-coloring

Basis theorems for continuous n-colorings

✍ Stefanie Frick; Stefan Geschke 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 239 KB

Interpolation theorem for partial Grundy

Interpolation theorem for partial Grundy coloring

✍ Balakrishnan, R.; Kavaskar, T. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 333 KB