✦ LIBER ✦

Note on the Number of Distinct Chromaticities

✍ Scribed by MACADAM, D. L.

Book ID: 115376838
Publisher: Optical Society of America
Year: 1947
Weight: 624 KB
Volume: 37
Category: Article
ISSN: 0030-3941
DOI: 10.1364/JOSA.37.0308_1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the star chromatic number

✍ J. A. Bondy; Pavol Hell 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 176 KB 👁 1 views

## Abstract A. Vince introduced a natural generalization of graph coloring and proved some basic facts, revealing it to be a concept of interest. His work relies on continuous methods. In this note we make some simple observations that lead to a purely combinatorial treatment. Our methods yield sho

A Note on the Number of Distinct Distanc

A Note on the Number of Distinct Distances

✍ G. Elekes 📂 Article 📅 1999 🏛 Springer Netherlands 🌐 English ⚖ 178 KB

A note on the complexity of the chromati

A note on the complexity of the chromatic number problem

✍ E.L. Lawler 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 285 KB

A note on the line-distinguishing chroma

A note on the line-distinguishing chromatic number and the chromatic index of a graph

✍ N. Zagaglia Salvi 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB 👁 1 views

## Abstract Let λ(__G__) be the line‐distinguishing chromatic number and __x__′(__G__) the chromatic index of a graph __G__. We prove the relation λ(__G__) ≥ __x__′(__G__), conjectured by Harary and Plantholt. © 1993 John Wiley & Sons, Inc.

Note on thenth chromatic numbers of the

Note on thenth chromatic numbers of the Gr�tzsch graph

✍ Stahl, Saul 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 95 KB 👁 2 views

It is shown that the n t h chromatic numbers of the Grotzsch graph provide the answer to an issue raised by

A Note on the m-Bounded Chromatic Number

A Note on the m-Bounded Chromatic Number of a Tree

✍ Bor-Liang Chen; Ko-Wei Lih 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 77 KB

The \(m\)-bounded chromatic number of a graph \(G\) is the smallest number of colors required for a proper coloring of \(G\) in which each color is used at most \(m\) times. We will establish an exact formula for the \(m\)-bounded chromatic number of a tree.