Cargando…
The complexity of frugal colouring
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 colouring with k colours was found by McCormick and...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer Berlin Heidelberg
2021
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8609890/ https://www.ncbi.nlm.nih.gov/pubmed/34840931 http://dx.doi.org/10.1007/s40065-021-00311-7 |