On the vertex-distinguishing proper edge-colorings of graphs
type: Item
instance of: scholarly article
title: On the vertex-distinguishing proper edge-colorings of graphs
zbMATH Open document ID: 0932.05036
author: Cristina Bazgan
author: Amel Harkat-Benhamdine
author: Hao Li
published in: Journal of Combinatorial Theory. Series B
publication date: 1999-11-29T00:00:00Z
review text: 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)].
reviewed by: Hao Li
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1346899
zbMATH Keywords: vertex-distinguishing
zbMATH Keywords: Kempe path
zbMATH Keywords: conjecture of Burris and Schelp
zbMATH Keywords: colouring
MaRDI profile type: Publication
cites work: Irregular Assignments of Trees and Forests
cites work: Q4028414
cites work: Q3097395
cites work: Vertex-distinguishing proper edge-colorings
cites work: Q4886768
cites work: Strong edge colorings of graphs
cites work: Asymptotic behaviour of the observability of \(Q_ n\)
cites work: Q4865126
cites work: Q4873753
description: scientific article; zbMATH DE number 1346899