Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Colour-blind can distinguish colour pallets

From MaRDI portal
Publication:405211
Jump to:navigation, search

zbMath1300.05107MaRDI QIDQ405211

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

zbMATH Keywords

colour palletcolour-blind personneighbour-distinguishing colouring


Mathematics Subject Classification ID

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


Related Items

Color-blind index in graphs of very low degree



Cites Work

  • Can colour-blind distinguish colour palettes?
  • Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
  • Edge weights and vertex colours
  • On colour-blind distinguishing colour pallets in regular graphs
  • Vertex-colouring edge-weightings
  • Degree constrained subgraphs
  • Vertex colouring edge partitions
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:405211&oldid=12275620"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 04:31.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki