| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656796 | Journal of Combinatorial Theory, Series B | 2015 | 11 Pages |
Abstract
This paper proves that for any positive integer k , every essentially (2k+1)(2k+1)-unbalanced (12k−1)(12k−1)-edge connected signed graph has circular flow number at most 2+1k.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Xuding Zhu,