Circular flow number of highly edge connected signed graphs
classification
🧮 math.CO
keywords
circularconnectededgeflownumbersignedessentiallyevery
read the original 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$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.