Circular flows in mono-directed signed graphs
Jiaao Li, Reza Naserasr, Zhouningxin Wang, Xuding Zhu

TL;DR
This paper introduces and studies the concept of circular $r$-flows in mono-directed signed graphs, establishing their properties, relations to other flow concepts, and bounds based on edge-connectivity.
Contribution
It defines circular $r$-flows for mono-directed signed graphs, explores their properties, and connects them with modulo orientations and homomorphisms in planar graphs.
Findings
Defined circular $r$-flows for mono-directed signed graphs.
Established bounds on the circular flow index based on edge-connectivity.
Linked circular flows to modulo $k$-orientations and duality in planar graphs.
Abstract
In this paper the concept of circular -flows in a mono-directed signed graph is introduced. That is a pair , where is an orientation on and satisfies that for each positive edge and for each negative edge , and the total in-flow equals the total out-flow at each vertex. The circular flow index of a signed graph with no positive bridge, denoted , is the minimum such that admits a circular -flow. This is the dual notion of circular colorings and circular chromatic numbers of signed graphs recently introduced in [Circular chromatic number of signed graphs. R. Naserasr, Z. Wang, and X. Zhu. Electronic Journal of Combinatorics, 28(2)(2021), \#P2.44], and is distinct from the concept of circular flows in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Limits and Structures in Graph Theory · Graph Labeling and Dimension Problems
