✦ LIBER ✦

Equitable colorings of Cartesian products of graphs

✍ Scribed by Wu-Hsiung Lin; Gerard J. Chang

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Equitable edge-colorings of simple graph

Equitable edge-colorings of simple graphs

✍ Xia Zhang; Guizhen Liu 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 199 KB

An edge-coloring of a graph G is equitable if, for each v ∈ V (G), the number of edges colored with any one color incident with v differs from the number of edges colored with any other color incident with v by at most one. A new sufficient condition for equitable edge-colorings of simple graphs is

List coloring of Cartesian products of g

List coloring of Cartesian products of graphs

✍ Mieczysław Borowiecki; Stanislav Jendrol’; Daniel Král’; Jozef Miškuf 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 157 KB

Equitable -coloring of graphs

✍ Bor-Liang Chen; Chih-Hung Yen 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 230 KB

Game coloring the Cartesian product of g

Game coloring the Cartesian product of graphs

✍ Xuding Zhu 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB

## Abstract This article proves the following result: Let __G__ and __G__′ be graphs of orders __n__ and __n__′, respectively. Let __G__^\*^ be obtained from __G__ by adding to each vertex a set of __n__′ degree 1 neighbors. If __G__^\*^ has game coloring number __m__ and __G__′ has acyclic chromat

Equitable colorings of planar graphs wit

Equitable colorings of planar graphs without short cycles

✍ Nakprasit, Keaitsuda; Nakprasit, Kittikorn 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 241 KB

Cartesian products of block graphs

✍ H. -J. Bandelt 📂 Article 📅 1995 🏛 Vandenhoeck & Ruprecht 🌐 German ⚖ 250 KB