𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On vertex-coloring 13-edge-weighting

✍ Scribed by Tao Wang; Qinglin Yu

Book ID
107376080
Publisher
Higher Education Press and Springer
Year
2008
Tongue
English
Weight
126 KB
Volume
3
Category
Article
ISSN
1673-3452

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On vertex-coloring edge-weighting of gra
On vertex-coloring edge-weighting of graphs
✍ Hongliang Lu; Xu Yang; Qinglin Yu πŸ“‚ Article πŸ“… 2009 πŸ› Higher Education Press and Springer 🌐 English βš– 159 KB
Vertex-Colouring Edge-Weightings
Vertex-Colouring Edge-Weightings
✍ Louigi Addario-Berry; Ketan Dalal; Colin McDiarmid; Bruce A. Reed; Andrew Thomas πŸ“‚ Article πŸ“… 2007 πŸ› Springer-Verlag 🌐 English βš– 196 KB
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{(