Realizing Degree Sequences With S3‐Connected Graphs
Journal of Graph Theory · 2026-10 · 113 (2) · 222-236
DOI: 10.1002/jgt.70062 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 14.05.2026. Verfasst von Rui Guan und 4 weiteren Autor:innen. Die Arbeit nennt 18 Literaturangaben. Gefördert von: National Natural Science Foundation of China, National Basic Research Program of China, Natural Science Foundation of Tianjin City.
Abstract (Originalsprache)
A graph is ‐connected if, for any mapping with , there exists a strongly connected orientation satisfying for any . It is known that ‐connected graphs are contractible configurations for the property of flow index strictly less than three. In this paper, we provide a complete characterization of graphic sequences that have an ‐connected realization: A graphic sequence has an ‐connected realization if and only if and . Consequently, every graphic sequence with has a realization with flow index strictly less than three. This supports the conjecture of Li, Thomassen, Wu and Zhang [European J. Combin., 70 (2018) 164‐177] that every 6‐edge‐connected graph has a flow index strictly less than three.
Förderung
- National Natural Science Foundation of China
- National Basic Research Program of China
- Natural Science Foundation of Tianjin City
Zitieren
APA
Guan, R., Jiang, C., Lai, H., Li, J., & Li, X. (2026). Realizing Degree Sequences With S3‐Connected Graphs. Journal of Graph Theory, 113(2), 222-236. https://doi.org/10.1002/jgt.70062
Vancouver
Guan R, Jiang C, Lai H, Li J, Li X. Realizing Degree Sequences With S3‐Connected Graphs. Journal of Graph Theory. 2026;113(2):222-236. doi:10.1002/jgt.70062
BibTeX
@article{Guan2026,
author = {Guan, Rui and Jiang, Chenglin and Lai, Hong‐Jian and Li, Jiaao and Li, Xinyuan},
title = {Realizing Degree Sequences With S3‐Connected Graphs},
journal = {Journal of Graph Theory},
year = {2026},
volume = {113},
number = {2},
pages = {222--236},
doi = {10.1002/jgt.70062}
}
EUVIMED