Indexed by：
Abstract：
Let (G, σ) be a 2-edge-connected flow-admissible signed graph. In this paper, we prove that (G, σ) has a signed circuit cover with length at most 3|E(G)|. © 2020, Springer Japan KK, part of Springer Nature.
Keyword：
Reprint 's Address：
Email：
Source ：
Graphs and Combinatorics
ISSN： 0911-0119
Year： 2020
Issue： 5
Volume： 36
Page： 1423-1443
0 . 4 9 8
JCR@2020
0 . 6 0 0
JCR@2023
ESI HC Threshold：50
JCR Journal Grade：4
CAS Journal Grade：4
Cited Count：
SCOPUS Cited Count：
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 1
Affiliated Colleges：
