The following pages link to Recognizable colorings of graphs (Q3527525):
Displaying 8 items.
- A proof of a conjecture on multiset coloring the powers of cycles (Q456085) (← links)
- Neighborhood distinguishing coloring in graphs (Q2016994) (← links)
- The singular chromatic number of a graph. (Q2804742) (← links)
- A code for disconnected edge-colored graphs (Q2844267) (← links)
- Recognizable colorings of cycles and trees (Q2906368) (← links)
- Vertex identification in trees (Q5051441) (← links)
- (Q5488328) (← links)
- Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm (Q5874317) (← links)