A note on edge colorings distinguishing all triangles in a graph
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916338095620096 |
|---|---|
| author | Pilsniak, Monika Wozniak, Mariusz |
| author_facet | Pilsniak, Monika Wozniak, Mariusz |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_19050 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A note on edge colorings distinguishing all triangles in a graph Pilsniak, Monika Wozniak, Mariusz Combinatorics 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. |
| title | A note on edge colorings distinguishing all triangles in a graph |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2407.19050 |