Circular Flow Indices of Signed Graphs and Strongly Connected Orientations

ABSTRACT This paper establishes a relation between orientations and circular flows in signed graphs. It is proved that the circular flow index of a signed graph is strictly smaller than if and only if it admits a strongly connected ‐extended‐Tutte orientation. As applications, we utilize a unified approach to show that every ‐edge‐connected signed planar graph has its circular flow index strictly less than for . By duality, this provides upper bounds for circular chromatic numbers of signed planar graphs with given girth conditions, improving several known results. In particular, our results imply that every signed planar graph of girth at least 8 has its circular chromatic number strictly less than 3.

Authors

Institutions

Publication Details

Journal
Journal of Graph Theory
Published
2026-08-25
DOI
https://doi.org/10.1002/jgt.70118
Primary Topic
Advanced Graph Theory Research
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Circular Flow Indices of Signed Graphs and Strongly Connected Orientations

Zhouningxin Wang, Yongtang Shi, Jiaao Li, Zhengke Miao et al.
Journal of Graph Theory
Advanced Graph Theory Research
article

Circular Flow Indices of Signed Graphs and Strongly Connected Orientations

Zhouningxin Wang, Yongtang Shi, Jiaao Li, Zhengke Miao, Chunyan Wei
article en

Abstract

ABSTRACT This paper establishes a relation between orientations and circular flows in signed graphs. It is proved that the circular flow index of a signed graph is strictly smaller than if and only if it admits a strongly connected ‐extended‐Tutte orientation. As applications, we utilize a unified approach to show that every ‐edge‐connected signed planar graph has its circular flow index strictly less than for . By duality, this provides upper bounds for circular chromatic numbers of signed planar graphs with given girth conditions, improving several known results. In particular, our results imply that every signed planar graph of girth at least 8 has its circular chromatic number strictly less than 3.

Journal of Graph Theory
Fujian Normal University (CN), Nankai University (CN)
National Natural Science Foundation of China, Ministry of Education of the People's Republic of China, Nankai University, Natural Science Foundation of Tianjin City, National Key Research and Development Program of China, Fundamental Research Funds for the Central Universities
Openalex Percentile: Top 8%
Advanced Graph Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Circular Flow Indices of Signed Graphs and Strongly Connected Orientations — Zhouningxin Wang, Yongtang Shi, et al. · Journal of Graph Theory (2026) | TGRS Research Map | TGRS