✦ LIBER ✦

Dynamic chromatic number of regular graphs

✍ Scribed by Meysam Alishahi

Book ID: 116401289
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 222 KB
Volume: 160
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.05.017

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Regular graphs and edge chromatic number

✍ R.J Faudree; J Sheehan 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 376 KB

For any simple graph G, Vizing's Theorem [5] implies that A (G)~)((G)<~ A(G)+ 1, where A (G) is the maximum degree of a vertex in G and x(G) is the edge chromatic number. It is of course possible to add edges to G without changing its edge chromatic number. Any graph G is a spanning subgraph of an e

Regular graphs with prescribed chromatic

Regular graphs with prescribed chromatic number

✍ L. Caccetta; N. J. Pullman 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 200 KB

## Abstract We determine the minimum number of edges in a regular connected graph on __n__ vertices, containing a complete subgraph of order __k__ ≤ __n__/2. This enables us to confirm and strengthen a conjecture of P. Erdös on the existence of regular graphs with prescribed chromatic number.

On the difference between chromatic numb

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

✍ A. Ahadi; S. Akbari; A. Dehghan; M. Ghanbari 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 200 KB

The total chromatic number of regular gr

The total chromatic number of regular graphs of high degree

✍ DeZheng Xie; WanNian Yang 📂 Article 📅 2009 🏛 SP Science China Press 🌐 English ⚖ 309 KB

On the -chromatic number of regular grap

On the -chromatic number of regular graphs without 4-cycle

✍ Saeed Shaebani 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 209 KB

The generalized acyclic edge chromatic n

The generalized acyclic edge chromatic number of random regular graphs

✍ Stefanie Gerke; Catherine Greenhill; Nicholas Wormald 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 224 KB 👁 1 views

## Abstract The __r__‐acyclic edge chromatic number of a graph is defined to be the minimum number of colors required to produce an edge coloring of the graph such that adjacent edges receive different colors and every cycle __C__ has at least min(|__C__|, __r__) colors. We show that (__r__ − 2)__d