Colour-blind can distinguish colour pallets

zbMATH Open1300.05107MaRDI QIDQ405211FDOQ405211

Authors: Jakub Przybyło 

Publication date: 4 September 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/v21i2p19

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• On colour-blind distinguishing colour pallets in regular graphs
• Can colour-blind distinguish colour palettes?
• How to personalize the vertices of a graph?
• Color-blind index in graphs of very low degree
• On the palette index of complete bipartite graphs

zbMATH Keywords

colour palletcolour-blind personneighbour-distinguishing colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Cites Work

• Edge weights and vertex colours
• Vertex-colouring edge-weightings
• Degree constrained subgraphs
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Vertex colouring edge partitions
• Can colour-blind distinguish colour palettes?
• On colour-blind distinguishing colour pallets in regular graphs

Cited In (4)

• Can colour-blind distinguish colour palettes?
• How to personalize the vertices of a graph?
• On colour-blind distinguishing colour pallets in regular graphs
• Color-blind index in graphs of very low degree

This page was built for publication: Colour-blind can distinguish colour pallets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405211)