Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Shayla Redlin"'
Publikováno v:
Arabian Journal of Mathematics
A t-frugal colouring of a graph G is an assignment of colours to the vertices of G, such that each colour appears at most t times in the neighbourhood of any vertex. A dichotomy theorem for the complexity of deciding whether a graph has a 1-frugal co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0e9ecda542b1a54bb271f9d05e5b7184
https://doi.org/10.1007/s40065-021-00311-7
https://doi.org/10.1007/s40065-021-00311-7
