Cargando…
The Complexity of Two Colouring Games
We consider two variants of orthogonal colouring games on graphs. In these games, two players alternate colouring uncoloured vertices (from a choice of [Formula: see text] colours) of a pair of isomorphic graphs while respecting the properness and the orthogonality of the partial colourings. In the...
| Autores principales: | , , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer US
2022
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10060359/ https://www.ncbi.nlm.nih.gov/pubmed/37008075 http://dx.doi.org/10.1007/s00453-022-01069-w |