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

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.