Eulerian Subgraphs and S-connectivity of Graphs

作者：

Highlights：

• A new relation between Eulerian subgraphs and flow of graphs is obtained.

• Settle a conjecture of Lai et al.(2011) for all but finite many Abelian groups.

• The proof combines graph theory techniques and advanced tools from group theory.

• Develop several tools for studying graph structures and graph flows with certain group values.

摘要

•A new relation between Eulerian subgraphs and flow of graphs is obtained.•Settle a conjecture of Lai et al.(2011) for all but finite many Abelian groups.•The proof combines graph theory techniques and advanced tools from group theory.•Develop several tools for studying graph structures and graph flows with certain group values.

论文关键词：Eulerian graphs,Collapsible graphs,Nowhere-zero flow,Connectivity

论文评审过程：Received 12 February 2020, Revised 10 April 2020, Accepted 19 April 2020, Available online 8 May 2020, Version of Record 8 May 2020.

论文官网地址：https://doi.org/10.1016/j.amc.2020.125323