𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Adjacent vertex-distinguishing edge colorings of -minor free graphs

✍ Scribed by Weifan Wang; Yiqiao Wang

Book ID
108052691
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
213 KB
Volume
24
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Vertex-distinguishing edge colorings of
Vertex-distinguishing edge colorings of graphs
✍ P. N. Balister; O. M. Riordan; R. H. Schelp πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 136 KB πŸ‘ 1 views
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