General neighbour-distinguishing index via chromatic number

DOI10.1016/j.disc.2009.11.018zbMath1222.05064OpenAlexW2032178488MaRDI QIDQ973148

Mirko Horňák, Roman Soták

Publication date: 28 May 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.11.018

zbMATH Keywords

chromatic numbercolour setgeneral neighbour-distinguishing indexneighbour-distinguishing edge colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Unnamed Item

Cites Work

• On the neighbour-distinguishing index of a graph
• Adjacent strong edge coloring of graphs
• General neighbour-distinguishing index of a graph
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• Adjacent Vertex Distinguishing Edge‐Colorings

This page was built for publication: General neighbour-distinguishing index via chromatic number