✦ LIBER ✦

On the difference between chromatic number and dynamic chromatic number of graphs

✍ Scribed by A. Ahadi; S. Akbari; A. Dehghan; M. Ghanbari

Book ID: 113567441
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 200 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.09.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dynamic chromatic number of regular grap

Dynamic chromatic number of regular graphs

✍ Meysam Alishahi 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 222 KB

On the Chromatic Number of Graphs

✍ S. Butenko; P. Festa; P. M. Pardalos 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 174 KB

On Group Chromatic Number of Graphs

✍ Hong-Jian Lai; Xiangwen Li 📂 Article 📅 2005 🏛 Springer Japan 🌐 English ⚖ 102 KB

Circular Chromatic Numbers and Fractiona

Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs

✍ G.J. Chang; L. Huang; X. Zhu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 171 KB

This paper studies circular chromatic numbers and fractional chromatic numbers of distance graphs G(Z , D) for various distance sets D. In particular, we determine these numbers for those D sets of size two, for some special D sets of size three, for

Edge-face chromatic number and edge chro

Edge-face chromatic number and edge chromatic number of simple plane graphs

✍ Rong Luo; Cun-Quan Zhang 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB

## Abstract Given a simple plane graph __G__, an edge‐face __k__‐coloring of __G__ is a function ϕ : __E__(__G__) ∪ __F__(G) → {1,…,__k__} such that, for any two adjacent or incident elements __a__, __b__ ∈ __E__(__G__) ∪ __F__(__G__), ϕ(__a__) ≠ ϕ(__b__). Let χ~e~(__G__), χ~ef~(__G__), and Δ(__G_

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