Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Švecová, Diana"'
A strong edge-coloring of a graph is a proper edge-coloring, in which the edges of every path of length 3 receive distinct colors; in other words, every pair of edges at distance at most 2 must be colored differently. The least number of colors neede
Externí odkaz:
http://arxiv.org/abs/2410.01049
