On the vertex-distinguishing proper edge-colorings of graphs (Q1305536)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the vertex-distinguishing proper edge-colorings of graphs |
scientific article; zbMATH DE number 1346899
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the vertex-distinguishing proper edge-colorings of graphs |
scientific article; zbMATH DE number 1346899 |
Statements
On the vertex-distinguishing proper edge-colorings of graphs (English)
0 references
29 November 1999
0 references
We prove the following conjecture of Burris and Schelp: a colouring 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; cf. \textit{A. C. Burris} and \textit{R. H. Schelp} [J. Graph Theory 26, No. 2, 73-82 (1997; Zbl 0886.05068)].
0 references
vertex-distinguishing
0 references
Kempe path
0 references
conjecture of Burris and Schelp
0 references
colouring
0 references
