Abstract
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)|.






Similar content being viewed by others
References
Alon, N., Tarsi, M.: Covering multigraphs by simple circuits. SIAM J. Algeb. Discrete Methods 6, 345–50 (1985)
Bermond, J.C., Jackson, B., Jaeger, F.: Shortest covering of graphs with cycles. J. Combin. Theory Ser. B 35, 297–308 (1983)
Bouchet, A.: Nowhere-zero integral flows on a bidirected graph. J. Combin. Theory Ser. B 34(3), 279–292 (1983)
Chen, J., Fan, G.: Short signed circuit cover of signed graphs. Discrete Appl. Math. 235, 51–58 (2018)
Cheng, J., Lu, Y., Luo, R., Zhang, C.-Q.: Shortest circuit cover of signed graphs. J. Combin. Theory Ser. B 134, 164–178 (2019)
Fan, G.: Proofs of two minimum circuit covers conjectures. J. Combin. Theory Ser. B 74, 353–367 (1998)
Jamshy, U., Tarsi, M.: Short cycle covers and the cycle double cover conjecture. J. Combin. Theory Ser. B 56, 197–204 (1992)
Itai, A., Rodeh, M.: Covering a graph by circuits, automata, languages, and programming. Lecture notes in computer science, vol. 62, pp. 289–299. Springer, Berlin (1978)
Kaiser, T., Lukot’ka, R., Máčajová, E., Rollovǎ, E.: Shorter signed circuit covers of graphs. J. Graph Theory 92, 39–56 (2019)
Máčajová, E., Raspaud, A., Rollovǎ, E., Škoviera, M.: Circuit covers of signed graphs. J. Graph Theory 81(2), 120–133 (2016)
Máčajová, E., Rollovǎ, E., Škoviera, M.: Circuit covers of signed Eulerian graphs. SIAM J. Discrete Math. 33, 933–957 (2019)
Seymour, P.D.: Sums of circuits. In: Bondy, J.A., Murty, U.S.R. (eds.) Graph theory and related topics, pp. 341–355. Academic Press, New York (1979)
Szekeres, G.: Polyhedral decompositions of cubic graphs. Bull. Aust. Math. Soc. 8, 367–387 (1973)
Wu, Y., Ye, D.: Circuit covers of cubic signed graphs. J. Graph Theory 89(1), 40–54 (2018)
Wu, Y., Ye, D.: Minimum T-joins and signed-circuit covering. arXiv:1803.03696
Zaslavsky, T.: Signed graphs. Discrete Appl. Math. 4, 47–74 (1982)
Zhang, C.-Q.: Circuit double cover of graphs. Cambridge University Press, London (2012)
Acknowledgements
The Funding has been recevied from National Natural Science Foundation of China with Grant nos. 11971110 and 11671087.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This research is supported by NSFC (11971110,11671087).
Rights and permissions
About this article
Cite this article
Xie, M., Zhou, C. Signed Circuit Cover of Bridgeless Signed Graphs. Graphs and Combinatorics 36, 1423–1443 (2020). https://doi.org/10.1007/s00373-020-02224-2
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-020-02224-2