𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Equitable Vertex Distinguishing Edge Colorings of Trees

✍ Scribed by YAO, Bing; CHEN, Xiang'en; SHAN, Songling

Book ID
121321944
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
356 KB
Volume
33
Category
Article
ISSN
0252-9602

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Vertex-distinguishing proper edge-colori
Vertex-distinguishing proper edge-colorings
✍ Burris, A. C.; Schelp, R. H. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 146 KB

An edge-coloring is called vertex-distinguishing if every two distinct vertices are incident to different sets of colored edges. The minimum number of colors required for a vertex-distinguishing proper edge-coloring of a simple graph G is denoted by Ο‡ s (G). A simple count shows that Ο‡ s (G) β‰₯ max{(

Adjacent Vertex Distinguishing Edge‐Colo
Adjacent Vertex Distinguishing Edge‐Colorings
✍ Balister, P. N.; Gyo˝ri, E.; Lehel, J.; Schelp, R. H. πŸ“‚ Article πŸ“… 2007 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 226 KB
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
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