On locating and neighbor-locating colorings of sparse graphs

DOI10.1016/j.dam.2024.07.012zbMATH Open1547.05087MaRDI QIDQ6611083

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

Publication date: 26 September 2024

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

zbMATH Keywords

Could not fetch data.

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Density (toughness, etc.) (05C42)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The locating chromatic number of the join of graphs
• Mastermind
• On the locating chromatic number of Kneser graphs
• On separating systems
• Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity
• Every planar map is four colorable. II: Reducibility
• Graphs of order \(n\) with locating-chromatic number \(n-1\)
• Upper bounds on the locating chromatic number of trees
• Neighbor-locating coloring: graph operations and extremal cardinalities
• Improved algorithm for the locating-chromatic number of trees
• Neighbor-locating colorings in graphs
• Calculating an upper bound of the locating-chromatic number of trees
• On the conjectures of neighbor locating coloring of graphs
• On the locating chromatic number of the Cartesian product of graphs.
• Learning Binary Relations and Total Orders
• On the Complexity of Canonical Labeling of Strongly Regular Graphs
• How complex are random graphs in first order logic?
• Reducibility among Combinatorial Problems
• Characterizing all trees with locating-chromatic number 3
• On Metric Generators of Graphs
• New bounds and constructions for neighbor-locating colorings of graphs

This page was built for publication: On locating and neighbor-locating colorings of sparse graphs

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