✦ LIBER ✦

Minimum sum edge colorings of multicycles

✍ Scribed by Jean Cardinal; Vlady Ravelomanana; Mario Valencia-Pabon

Book ID: 108112822
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 355 KB
Volume: 158
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2009.04.020

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum Number of Palettes in Edge Color

Minimum Number of Palettes in Edge Colorings

✍ Mirko Horňák, Rafał Kalinowski, Mariusz Meszka, Mariusz Woźniak 📂 Article 📅 2013 🏛 Springer Japan 🌐 English ⚖ 319 KB

Coloring of trees with minimum sum of co

Coloring of trees with minimum sum of colors

✍ Jiang, Tao; West, Douglas B. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 227 KB

The chromatic sum of a graph is the smallest sum of colors among all proper colorings with natural numbers. The strength is the minimum number of colors needed to achieve the chromatic sum. We construct for each positive integer k a tree with strength k that has maximum degree only 2k -2. The result

Minimum Color Sum of Bipartite Graphs

✍ Amotz Bar-Noy; Guy Kortsarz 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 242 KB

The problem of minimum color sum of a graph is to color the vertices of the Ž . graph such that the sum average of all assigned colors is minimum. Recently it was shown that in general graphs this problem cannot be approximated within 1y ⑀ Ž n , for any ⑀ ) 0, unless NP s ZPP Bar-Noy et al., Informa

Vertex-Distinguishing Edge Colorings of

Vertex-Distinguishing Edge Colorings of Graphs with Degree Sum Conditions

✍ Bin Liu; Guizhen Liu 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 183 KB

Neighbor sum distinguishing edge colorin

Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree

✍ Dong, Aijun; Wang, Guanghui; Zhang, Jianghua 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 473 KB

Interval edge-colorings of

✍ Grzesik, A.; Khachatrian, H. 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 361 KB