Locally identifying colourings for graphs with given maximum degree

DOI10.1016/j.disc.2012.01.034zbMath1242.05092arXiv1108.2769MaRDI QIDQ418899

Aline Parreau, Tero Laihonen, Guillem Perarnau, Florent Foucaud, Iiro S. Honkala

Publication date: 30 May 2012

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

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

zbMATH Keywords

identification; graph colouring; chordal graphs; maximum degree

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C15: Coloring of graphs and hypergraphs

05C07: Vertex degrees

Related Items

On locally identifying coloring of graphs, Inapproximability of the lid-chromatic number, Relaxed locally identifying coloring of graphs, Extension of universal cycles for globally identifying colorings of cycles, On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs, Locally identifying coloring of graphs with few P4s, Locally identifying coloring in bounded expansion classes of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal cardinalities for identifying and locating-dominating codes in graphs
• Graph Classes: A Survey
• Vertex-distinguishing proper edge-colorings
• On a new class of codes for identifying vertices in graphs
• Vertex-distinguishing edge colorings of graphs
• k-Degenerate Graphs