Locally identifying coloring of graphs with few P4s

DOI10.1016/j.tcs.2017.10.015zbMath1383.05112OpenAlexW2765098491MaRDI QIDQ1685965

Nícolas A. Martins, Rudini Menezes Sampaio

Publication date: 20 December 2017

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.10.015

zbMATH Keywords

cographslocally identifying coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

On locally identifying coloring of graphs

Cites Work

• Unnamed Item
• Locally identifying colourings for graphs with given maximum degree
• Locally identifying coloring of graphs
• Complement reducible graphs
• A tree representation for \(P_ 4\)-sparse graphs
• On the structure of graphs with few \(P_4\)s
• Locally identifying coloring in bounded expansion classes of graphs
• Linear degree extractors and the inapproximability of max clique and chromatic number
• A Linear Recognition Algorithm for Cographs
• Vertex-distinguishing proper edge-colorings
• On a new class of codes for identifying vertices in graphs
• Vertex-distinguishing edge colorings of graphs
• P-Components and the Homogeneous Decomposition of Graphs
• Efficient algorithms for graphs with few \(P_4\)'s

This page was built for publication: Locally identifying coloring of graphs with few P4s