On locally identifying coloring of graphs
From MaRDI portal
Publication:6132530
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
Cites work
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- Counterexamples to Hedetniemi's conjecture
- Graphs with Given Group and Given Graph-Theoretical Properties
- Locally identifying coloring in bounded expansion classes of graphs
- Locally identifying coloring of graphs
- Locally identifying coloring of graphs with few P4s
- Locally identifying colourings for graphs with given maximum degree
- The chromatic number and other functions of the lexicographic product
Cited in
(6)- On locally identifying coloring of Cartesian product and tensor product of graphs
- Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm
- Locally identifying coloring of graphs with few P4s
- Deterministic local algorithms, unique identifiers, and fractional graph colouring
- scientific article; zbMATH DE number 2097236 (Why is no real title available?)
- Locality of not-so-weak coloring
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)