当前位置: X-MOL 学术J. Graph Theory › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
On dihedral flows in embedded graphs
Journal of Graph Theory ( IF 0.9 ) Pub Date : 2018-11-28 , DOI: 10.1002/jgt.22427
Bart Litjens 1
Affiliation  

Abstract Let Γ be a multigraph with for each vertex a cyclic order of the edges incident with it. For n≥3, let D2n be the dihedral group of order 2n. Define D≔{(±1a01)∣a∈Z}. Goodall et al in 2016 asked whether Γ admits a nowhere‐identity D2n‐flow if and only if it admits a nowhere‐identity D‐flow with ∣a∣

中文翻译:

关于嵌入图中的二面流

摘要 令Γ 是一个多重图,对于每个顶点,其边缘的循环顺序与它有关。对于 n≥3,令 D2n 为 2n 阶二面体群。定义 D≔{(±1a01)∣a∈Z}。Goodall 等人在 2016 年询问 Γ 是否承认无处恒等 D2n-流当且仅当它承认具有 ∣a∣ 的无处恒等 D-流
更新日期:2018-11-28
down
wechat
bug