General neighbour-distinguishing index via chromatic number
type: Item
instance of: scholarly article
title: General neighbour-distinguishing index via chromatic number
zbMATH Open document ID: 1222.05064
author: Mirko Horňák
author: Roman Soták
published in: Discrete Mathematics
publication date: 2010-05-28T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5713544
zbMATH Keywords: colour set
zbMATH Keywords: neighbour-distinguishing edge colouring
zbMATH Keywords: general neighbour-distinguishing index
zbMATH Keywords: chromatic number
MaRDI profile type: Publication
full work available at URL: j.disc.2009.11.018
OpenAlex ID: W2032178488
cites work: Adjacent Vertex Distinguishing Edge‐Colorings
cites work: On the neighbour-distinguishing index of a graph
cites work: General neighbour-distinguishing index of a graph
cites work: \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
cites work: Adjacent strong edge coloring of graphs
DOI: 10.1016/J.DISC.2009.11.018
description: scientific article; zbMATH DE number 5713544