A Vizing-like theorem for union vertex-distinguishing edge coloring

DOI10.1016/j.dam.2017.07.002zbMath1372.05065arXiv1605.02588OpenAlexW2964029593MaRDI QIDQ2410224

Antoine Dailly, Nicolas Bousquet, Hamamache Kheddouci, Aline Parreau, Eric Duchêne

Publication date: 17 October 2017

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

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

zbMATH Keywords

graph coloringvertex distinguishing coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Locally identifying coloring of graphs
• Gap vertex-distinguishing edge colorings of graphs
• Set colorings of graphs
• Vertex-distinguishing proper edge-colorings
• On a new class of codes for identifying vertices in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Vizing-like theorem for union vertex-distinguishing edge coloring