✦ LIBER ✦

Vertex-distinguishing edge-colorings of 2-regular graphs

✍ Scribed by P. Wittmann

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 755 KB
Volume: 79
Category: Article
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(97)00048-6

No coin nor oath required. For personal study only.

✦ Synopsis

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).

📜 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

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

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{(

Vertex-Distinguishing Edge Colorings of

Vertex-Distinguishing Edge Colorings of Graphs with Degree Sum Conditions

✍ Bin Liu; Guizhen Liu 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 183 KB

Adjacent vertex distinguishing edge-colo

Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree

✍ Weifan Wang; Yiqiao Wang 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 406 KB

Vertex signatures and edge-4-colorings o

Vertex signatures and edge-4-colorings of 4-regular plane graphs

✍ François Jaeger; Gerhard Koester 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 231 KB 👁 1 views

## Abstract We associate partitions of the edge‐set of a 4‐regular plane graph into 1‐factors or 2‐factors to certain 3‐valued vertex signatures in the spirit of the work by H. Grötzsch [1]. As a corollary we obtain a simple proof of a result of F. Jaeger and H. Shank [2] on the edge‐4‐colorability