Can colour-blind distinguish colour palettes?

zbMath1295.05107MaRDI QIDQ396838

Monika Pilśniak, Jakub Przybyło, Mariusz Woźniak, Rafał Kalinowski

Publication date: 14 August 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i3p23

zbMATH Keywords

graph colouringLovász local lemmadistinguishing adjacent vertices

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Colour-blind can distinguish colour pallets ⋮ On colour-blind distinguishing colour pallets in regular graphs ⋮ Color-blind index in graphs of very low degree

Cites Work

• Unnamed Item
• Lopsided Lovász Local lemma and Latin transversals
• Edge weights and vertex colours
• Vertex colouring edge partitions
• A simpler counterexample to the reconstruction conjecture for denumerable graphs

This page was built for publication: Can colour-blind distinguish colour palettes?