Back to Search Start Over

Circular flow number of highly edge connected signed graphs

Authors :
Zhu, Xuding
Publication Year :
2012

Abstract

This paper proves that for any positive integer $k$, every essentially $(2k+1)$-unbalanced $(12k-1)$-edge connected signed graph has circular flow number at most $2+\frac 1k$.<br />Comment: 11 pages

Subjects

Subjects :
Mathematics - Combinatorics
05C

Details

Database :
arXiv
Publication Type :
Report
Accession number :
edsarx.1211.3179
Document Type :
Working Paper

Tools

Authors Abstract Subjects Details