Neighbor-locating colorings in graphs

DOI10.1016/j.tcs.2019.01.039zbMath1442.05054arXiv1806.11465OpenAlexW2810525732MaRDI QIDQ2285128

Liliana Alcón, Marisa Gutierrez, Ignacio M. Pelayo, Mercè Mora, Carmen Hernando

Publication date: 16 January 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

locationdominationcoloringvertex partitionneighbor-locating coloring

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items (3)

On the conjectures of neighbor locating coloring of graphs ⋮ New bounds and constructions for neighbor-locating colorings of graphs ⋮ Neighbor-locating coloring: graph operations and extremal cardinalities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The locating chromatic number of the join of graphs
• The partition dimension of strong product graphs and Cartesian product graphs
• A note on the partition dimension of Cartesian product graphs
• On the locating chromatic number of Kneser graphs
• Locating-dominating codes: bounds and extremal cardinalities
• Graphs of order \(n\) with locating-chromatic number \(n-1\)
• The partition dimension of a graph
• Extremal graph theory for metric dimension and diameter
• Locating domination in bipartite graphs and their complements
• Nordhaus-Gaddum bounds for locating domination
• The partition dimension of Cayley digraphs
• On the partition dimension of trees
• On the Locating Chromatic Number of the Cartesian Product of Graphs
• On the partition dimension of unicyclic graphs
• On the Metric Dimension of Cartesian Products of Graphs
• The locating-chromatic number for Halin graphs
• On some resolving partitions for the lexicographic product of two graphs
• A Bound for the Locating Chromatic Numbers of Trees
• The partition dimension of circulant graphs
• Sur le coloriage des graphs

This page was built for publication: Neighbor-locating colorings in graphs