✦ LIBER ✦

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

✍ Scribed by Bor-Liang Chen; Ko-Wei Lih

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 77 KB
Volume: 14
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.1993.1034

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 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 New Bound on the Cyclic Chromatic Numb

A New Bound on the Cyclic Chromatic Number

✍ Daniel P. Sanders; Yue Zhao 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 116 KB

In 1969, Ore and Plummer defined an angular coloring as a natural extension of the Four Color Problem: a face coloring of a plane graph where faces meeting even at a vertex must have distinct colors. A natural lower bound is the maximum degree 2 of the graph. Some graphs require w 3 2 2x colors in a

A lower bound on the chromatic number of

A lower bound on the chromatic number of a graph

✍ B. R. Myers; R. Liu 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 1 views

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.

A Lower Bound for the One-Chromatic Numb

A Lower Bound for the One-Chromatic Number of a Surface

✍ V.P. Korzhik 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 487 KB

A new upper bound on the cyclic chromati

A new upper bound on the cyclic chromatic number

✍ O. V. Borodin; H. J. Broersma; A. Glebov; J. van den Heuvel 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB 👁 1 views

## Abstract A cyclic coloring of a plane graph is a vertex coloring such that vertices incident with the same face have distinct colors. The minimum number of colors in a cyclic coloring of a graph is its cyclic chromatic number χ^__c__^. Let Δ^\*^ be the maximum face degree of a graph. There exist