Neighborhood distinguishing coloring in graphs

MaRDI QIDQ2016994zbMATH OpenFDO

Authors Ramar Rajasekaran, Swaminathan Venkatasubramanian

Publication date 24 June 2014

Published in Innovations in Incidence Geometry (Search for Journal in Brave)

zbMATH Keywords

neighborhood distinguishing coloring codeneighborhood distinguishing coloring number of a graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Recognizable colorings of graphs
• Neighbor-distinguishing vertex colorings of graphs
• Covering codes of a graph associated with a finite vector space
• Multi-set neighbor distinguishing 3-edge coloring
• New bounds for codes identifying vertices in graphs

Cited in

(5)

• scientific article; zbMATH DE number 5942285 (Why is no real title available?)
• Graph color coding coding for number system
• On the conjectures of neighbor locating coloring of graphs
• scientific article; zbMATH DE number 5722817 (Why is no real title available?)
• scientific article; zbMATH DE number 6468154 (Why is no real title available?)

This page was built for publication: Neighborhood distinguishing coloring in graphs

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