Year: 2023
Type: preprint
Abstract: We consider edge colorings of graphs. An edge coloring is a majority coloring if for every vertex at most half of the edges incident with it are in one color. And edge coloring is a distinguishing coloring if for every non-trivial automorphism at least one edge changes its color. We consider these two notions together. We show that every graph without pendant edges has a majority distinguishing edge coloring with at most $\lceil\sqrtΔ\rceil+5$ colors. Moreover, we show results for some classes of graphs and a~general result for symmetric digraphs.
Source: arXiv (Cornell University)
Authors: Gorzkowska, Aleksandra, Prorok, Magdalena
Institution: AGH University of Krakow
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4389650125