On the locating chromatic number of Kneser graphs

DOI10.1016/j.dam.2011.07.015zbMath1241.05028arXiv1104.3097OpenAlexW2099985062MaRDI QIDQ765319

Behnaz Omoomi, Ali Behtoei

Publication date: 19 March 2012

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

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

zbMATH Keywords

Kneser graphmetric dimensionlocating chromatic numberlocating coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (8)

Approximations for certain hyperbolic functions by partial sums of their Taylor series and completely monotonic functions related to gamma function ⋮ The locating chromatic number for m-shadow of a connected graph ⋮ On the conjectures of neighbor locating coloring of graphs ⋮ New bounds and constructions for neighbor-locating colorings of graphs ⋮ Total dominator chromatic number of Kneser graphs ⋮ On the locating chromatic number of certain barbell graphs ⋮ Neighbor-locating colorings in graphs ⋮ A Bound for the Locating Chromatic Numbers of Trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Kneser's conjecture, chromatic number, and homotopy
• On \(b\)-coloring of the Kneser graphs
• Inequalities for binomial coefficients
• Circular chromatic number of Kneser graphs
• Graphs of order \(n\) with locating-chromatic number \(n-1\)
• The multichromatic numbers of some Kneser graphs
• Conditional resolvability in graphs: a survey
• The partition dimension of a graph
• On the diameter of Kneser graphs
• On Connected Resolving Decompositions in Graphs
• On the Addressing Problem for Loop Switching

This page was built for publication: On the locating chromatic number of Kneser graphs