Color-blind index in graphs of very low degree

DOI10.1016/j.dam.2017.03.006zbMath1361.05044arXiv1506.08345OpenAlexW1670006745MaRDI QIDQ528569

Devon Sigler, Lauren M. Nelsen, Derrick Stolee, Luke L. Nelsen, Nathan Graber, Victor Larsen, Charlie Suer, Lucas Kramer, Jennifer Diemunsch

Publication date: 12 May 2017

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

Full work available at URL: https://arxiv.org/abs/1506.08345

zbMATH Keywords

NP-completeness2-colorable hypergraphscolor-blind indexvertex-distinguishing edge-colorings

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Can colour-blind distinguish colour palettes?
• Colour-blind can distinguish colour pallets
• List-colourings of graphs
• Pólya's permanent problem
• On 2-coloring certain \(k\)-uniform hypergraphs
• Every 8-uniform 8-regular hypergraph is 2-colorable
• 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs
• The Even Cycle Problem for Directed Graphs
• Vertex-distinguishing edge colorings of graphs
• Computational Complexity
• Unnamed Item
• Unnamed Item

This page was built for publication: Color-blind index in graphs of very low degree