✦ LIBER ✦

A note on the star chromatic number

✍ Scribed by J. A. Bondy; Pavol Hell

Publisher: John Wiley and Sons
Year: 1990
Tongue: English
Weight: 176 KB
Volume: 14
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190140412

No coin nor oath required. For personal study only.

✦ Synopsis

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 shorter proofs and offer further insight.

📜 SIMILAR VOLUMES

Star chromatic number

✍ A. Vince 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 393 KB

The star chromatic number of a graph

✍ H. L. Abbott; B. Zhou 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 469 KB 👁 2 views

## Abstract We study a generalization of the notion of the chromatic number of a graph in which the colors assigned to adjacent vertices are required to be, in a certain sense, far apart. © 1993 John Wiley & Sons, Inc.

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 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.

The star-chromatic number of planar grap

The star-chromatic number of planar graphs

✍ Moser, David 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB 👁 2 views

The star-chromatic number of a graph, a parameter introduced by Vince, is a natural generalization of the chromatic number of a graph. Here we construct planar graphs with star-chromatic number r, where r is any rational number between 2 and 3, partially answering a question of Vince.

Some Theorems Concerning the Star Chroma

Some Theorems Concerning the Star Chromatic Number of a Graph

✍ Bing Zhou 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 379 KB

We investigate the notion of the star chromatic number of a graph in conjunction with various other graph parameters, among them, clique number, girth, and independence number. 1997 Academic Press /\*(G)=inf { m d : G has an (m, d )&coloring = . article no. TB961738 245 0095-8956Â97 25.00