𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The edge-labeling and vertex-colors ofKn

✍ Scribed by hadi Mohammad Alaeiyan

Book ID
119915521
Publisher
Springer-Verlag
Year
2012
Tongue
English
Weight
137 KB
Volume
6
Category
Article
ISSN
2251-7456

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Edge-Injective and Edge-Surjective Verte
Edge-Injective and Edge-Surjective Vertex Labellings
✍ Brandt, Stephan; MiΕ‘kuf, Jozef; Rautenbach, Dieter; Regen, Friedrich; Ruzsa, Imr πŸ“‚ Article πŸ“… 2010 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 386 KB
Some undecidable problems involving the
Some undecidable problems involving the edge-coloring and vertex-coloring of graphs
✍ Stefan A. Burr πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 477 KB

Certain problems involving the coloring the edges or vertices of infinite graphs are shown to be undecidable. In particular, let G and H be finite 3-connected graphs, or triangles. Then a doubly-periodic infinite graph F is constructed such that the following problem is undecidable: For a coloring o

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