On locally identifying coloring of graphs

DOI10.1007/978-3-031-25211-2_11OpenAlexW4318023000MaRDI QIDQ6132530FDOQ6132530

Authors: Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy 

Publication date: 17 August 2023

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

Full work available at URL: https://doi.org/10.1007/978-3-031-25211-2_11

Recommendations

• Locally identifying coloring of graphs
• On the local colorings of graphs
• scientific article; zbMATH DE number 2188610
• Locally identifying colourings for graphs with given maximum degree
• Locally identifying coloring in bounded expansion classes of graphs
• Relaxed locally identifying coloring of graphs
• A note on local coloring of graphs
• A note on local colorings of graphs
• Coloring graphs with locally few colors
• Locally identifying coloring of graphs with few P4s

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Title not available (Why is that?)
• Graphs with Given Group and Given Graph-Theoretical Properties
• The chromatic number and other functions of the lexicographic product
• Locally identifying coloring in bounded expansion classes of graphs
• Locally identifying colourings for graphs with given maximum degree
• Locally identifying coloring of graphs
• Counterexamples to Hedetniemi's conjecture
• Locally identifying coloring of graphs with few P4s

Cited In (6)

• Locality of not-so-weak coloring
• Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm
• Title not available (Why is that?)
• On locally identifying coloring of Cartesian product and tensor product of graphs
• Deterministic local algorithms, unique identifiers, and fractional graph colouring
• Locally identifying coloring of graphs with few P4s

This page was built for publication: On locally identifying coloring of graphs

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