On neighbour-distinguishing colourings from lists

DOI10.1016/J.ENDM.2006.06.022zbMath1202.05044OpenAlexW2137589689MaRDI QIDQ3439452

Mirko Horňák, Mariusz Woźniak

Publication date: 29 May 2007

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

Full work available at URL: https://hal.inria.fr/hal-00990586/file/1319-7351-2-PB.pdf

zbMATH Keywords

list colouringneighbour-distinguishing colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Neighbor-distinguishing \(k\)-tuple edge-colorings of graphs

Cites Work

• Adjacent strong edge coloring of graphs
• General neighbour-distinguishing index of a graph
• Adjacent Vertex Distinguishing Edge‐Colorings

This page was built for publication: On neighbour-distinguishing colourings from lists