Shorter signed circuit covers of graphs
From MaRDI portal
Abstract: A signed circuit is a minimal signed graph (with respect to inclusion) that admits a nowhere-zero flow. We show that each flow-admissible signed graph on edges can be covered by signed circuits of total length at most , improving a recent result of Cheng et al. [manuscript, 2015]. To obtain this improvement we prove several results on signed circuit covers of trees of Eulerian graphs, which are connected signed graphs such that removing all bridges results in a collection of Eulerian graphs.
Recommendations
Cited in
(13)- Shortest circuit covers of signed graphs
- Conformal decomposition of integral flows on signed graphs with outer-edges
- A note on shortest sign-circuit cover of signed 3-edge-colorable cubic graphs
- Signed circuit cover of bridgeless signed graphs
- Circuit \(k\)-covers of signed graphs
- Strongly even cycle decomposable 4-regular line graphs
- Characteristic flows on signed graphs and short circuit covers
- Circuit covers of signed graphs
- Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4
- Circuit covers of cubic signed graphs
- Minimum \(T\)-joins and signed-circuit covering
- Circuit covers of signed Eulerian graphs
- Signed circuit 6-covers of signed K₄-minor-free graphs
This page was built for publication: Shorter signed circuit covers of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5241604)
