Circular flow number of highly edge connected signed graphs
Circular flow number of highly edge connected signed graphs
复制标题
DOI:
10.1016/j.jctb.2014.12.002
复制
发表时间:
2012-11
期刊:
影响因子:
--
通讯作者:
Xuding Zhu
中科院分区:
文献类型:
--
作者:
Xuding Zhu
This paper proves that for any positive integer k, every essentially (2 k+ 1)-unbalanced (12 k− 1)-edge connected signed graph has circular flow number at most 2+ 1 k.