Locally identifying coloring in bounded expansion classes of graphs

DOI10.1016/j.dam.2013.07.003zbMath1287.05044arXiv1212.5468OpenAlexW2005160673MaRDI QIDQ2446886

Daniel Gonçalves, Alexandre Pinlou, Aline Parreau

Publication date: 23 April 2014

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

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

zbMATH Keywords

planar graphsminor-closed classesbounded expansion classeslocally identifying chromatic number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Inapproximability of the lid-chromatic number, Relaxed locally identifying coloring of graphs, The \(k\)-strong induced arboricity of a graph, Locally identifying coloring of graphs with few P4s, On locally identifying coloring of graphs, On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Locally identifying colourings for graphs with given maximum degree
• Locally identifying coloring of graphs
• Extremal cardinalities for identifying and locating-dominating codes in graphs
• Grad and classes with bounded expansion. I: Decompositions
• Induced subsets
• Vertex-distinguishing proper edge-colorings
• On a new class of codes for identifying vertices in graphs
• Vertex-distinguishing edge colorings of graphs