𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Erratum to: Vertex-Distinguishing E-Total Colorings of Graphs

✍ Scribed by Xiang’en Chen; Yue Zu; Zhongfu Zhang

Book ID
107702134
Publisher
Springer-Verlag
Year
2011
Tongue
English
Weight
102 KB
Volume
36
Category
Article
ISSN
1319-8025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Vertex-distinguishing edge-colorings of
Vertex-distinguishing edge-colorings of 2-regular graphs
✍ P. Wittmann 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 755 KB

Aigner et al., proved that for the irregular coloring number c(G) of a simple 2-regular graph of order n the inequality c(G) < v'& + 0( 1) holds. Here it is shown that c(G) < & + 0( 1).

On the Vertex-Distinguishing Proper Edge
On the Vertex-Distinguishing Proper Edge-Colorings of Graphs
✍ Cristina Bazgan; Amel Harkat-Benhamdine; Hao Li; Mariusz Woźniak 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 189 KB

We prove the conjecture of Burris and Schelp: a coloring of the edges of a graph of order n such that a vertex is not incident with two edges of the same color and any two vertices are incident with different sets of colors is possible using at most n+1 colors. 1999 Academic Press ## 1. Introducti