Circular flow number of highly edge connected signed graphs
Combinatorics
2012-11-15 v1
Abstract
This paper proves that for any positive integer , every essentially -unbalanced -edge connected signed graph has circular flow number at most .
Keywords
Cite
@article{arxiv.1211.3179,
title = {Circular flow number of highly edge connected signed graphs},
author = {Xuding Zhu},
journal= {arXiv preprint arXiv:1211.3179},
year = {2012}
}
Comments
11 pages