𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Group Chromatic Number of Graphs

✍ Scribed by Hong-Jian Lai; Xiangwen Li

Publisher
Springer Japan
Year
2005
Tongue
English
Weight
102 KB
Volume
21
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the chromatic number of disk graphs
On the chromatic number of disk graphs
✍ Malesi?ska, Ewa; Piskorz, Steffen; WeiοΏ½enfels, Gerhard πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 172 KB πŸ‘ 2 views

Colorings of disk graphs arise in the study of the frequency-assignment problem in broadcast networks. Motivated by the observations that the chromatic number of graphs modeling real networks hardly exceeds their clique number, we examine the related properties of the unit disk (UD) graphs and their

On the cost-chromatic number of graphs
On the cost-chromatic number of graphs
✍ John Mitchem; Patrick Morriss πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 566 KB

We consider vertex colorings in which each color has an associated cost, incurred each time the color is assigned to a vertex. For a given set of costs, a minimum-cost coloring is a vertex coloring which makes the total cost of coloring the graph as small as possible. The cost-chromatic number of a

Group chromatic number of planar graphs
Group chromatic number of planar graphs of girth at least 4
✍ Hong-Jian Lai; Xiangwen Li πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 212 KB πŸ‘ 1 views

## Abstract Jeager et al. introduced a concept of group connectivity as a generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5‐edge connected graph is Z~3~‐connected. For planar graphs, this is equivalent to that every planar graph with girth at lea