A note on edge colorings distinguishing all triangles in a graph
Monika Pilśniak, Mariusz Woźniak · arXiv (Cornell University) · 2024
We consider edge colorings of a graph in such a way that each two different triangles have distinct colorings. It is an extension of the well-known idea of distinguishing all maximal stars in a graph. It was introduced in literature in 1985 and studied by many authors in various variants, but always for stars. We estimate new invariants regarding triangles for proper and general colorings.