Cargando…
On dihedral flows in embedded graphs
Let [Formula: see text] be a multigraph with for each vertex a cyclic order of the edges incident with it. For [Formula: see text] , let [Formula: see text] be the dihedral group of order [Formula: see text]. Define [Formula: see text]. Goodall et al in 2016 asked whether [Formula: see text] admits...
| Autor principal: | |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
John Wiley and Sons Inc.
2018
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6559332/ https://www.ncbi.nlm.nih.gov/pubmed/31217666 http://dx.doi.org/10.1002/jgt.22427 |