Cargando…
Single‐conflict colouring
Given a multigraph, suppose that each vertex is given a local assignment of [Formula: see text] colours to its incident edges. We are interested in whether there is a choice of one local colour per vertex such that no edge has both of its local colours chosen. The least [Formula: see text] for which...
| Autores principales: | , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
John Wiley and Sons Inc.
2020
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8048893/ https://www.ncbi.nlm.nih.gov/pubmed/33888935 http://dx.doi.org/10.1002/jgt.22646 |