Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Neighborhood distinguishing coloring in graphs

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

zbMATH Open1293.05121MaRDI QIDQ2016994FDOQ2016994


Authors: Ramar Rajasekaran, Swaminathan Venkatasubramanian Edit this on Wikidata


Publication date: 24 June 2014

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





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


zbMATH Keywords

neighborhood distinguishing coloring codeneighborhood distinguishing coloring number of a graph


Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)



Cited In (5)

  • Graph color coding coding for number system
  • Title not available (Why is that?)
  • Title not available (Why is that?)
  • On the conjectures of neighbor locating coloring of graphs
  • Title not available (Why is that?)





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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2016994&oldid=14488993"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 1 February 2024, at 18:35. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki