New bounds and constructions for neighbor-locating colorings of graphs

DOI10.1007/978-3-031-25211-2_9arXiv2301.13557OpenAlexW4318023129MaRDI QIDQ6132528

Florent Foucaud, Soumen Nandi, Sagnik Sen, Dipayan Chakraborty, D. K. Supraja

Publication date: 17 August 2023

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

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

zbMATH Keywords

location problemidentification problemcoloringneighbor-locating coloringneighbor-locating chromatic number

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The locating chromatic number of the join of graphs
• Locally identifying coloring of graphs
• Mastermind
• On the locating chromatic number of Kneser graphs
• Graphs of order \(n\) with locating-chromatic number \(n-1\)
• Neighbor-locating coloring: graph operations and extremal cardinalities
• Neighbor-locating colorings in graphs
• On the conjectures of neighbor locating coloring of graphs
• On the Locating Chromatic Number of the Cartesian Product of Graphs
• On the Complexity of Canonical Labeling of Strongly Regular Graphs
• On a new class of codes for identifying vertices in graphs
• The locating-chromatic number for Halin graphs
• How complex are random graphs in first order logic?
• A Bound for the Locating Chromatic Numbers of Trees

This page was built for publication: New bounds and constructions for neighbor-locating colorings of graphs