当前位置:
X-MOL 学术
›
Graphs Comb.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Signed Circuit Cover of Bridgeless Signed Graphs
Graphs and Combinatorics ( IF 0.6 ) Pub Date : 2020-08-27 , DOI: 10.1007/s00373-020-02224-2 Mengmeng Xie , Chuixiang Zhou
中文翻译:
无桥签名图的签名电路封面
更新日期:2020-08-27
Graphs and Combinatorics ( IF 0.6 ) Pub Date : 2020-08-27 , DOI: 10.1007/s00373-020-02224-2 Mengmeng Xie , Chuixiang Zhou
Let \((G, \sigma )\) be a 2-edge-connected flow-admissible signed graph. In this paper, we prove that \((G,\sigma )\) has a signed circuit cover with length at most 3|E(G)|.
中文翻译:
无桥签名图的签名电路封面
令\(((G,\ sigma)\))是2边连接的流量允许符号图。在本文中,我们证明\((G,\ sigma)\)的带符号电路盖的长度最大为3 |。E(G)|。