Minimum $T$-Joins and Signed-Circuit Covering
From MaRDI portal
Publication:5112825
DOI10.1137/18M1226105zbMath1441.05098arXiv1803.03696OpenAlexW3026067370MaRDI QIDQ5112825
Publication date: 9 June 2020
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.03696
Paths and cycles (05C38) Distance in graphs (05C12) Connectivity (05C40) Signed and weighted graphs (05C22)
Related Items (3)
Circuit \(k\)-covers of signed graphs ⋮ A note on shortest sign-circuit cover of signed 3-edge-colorable cubic graphs ⋮ Signed circuit cover of bridgeless signed graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Covering weighted graphs by even subgraphs
- Shortest coverings of graphs with cycles
- Nowhere-zero integral flows on a bidirected graph
- Short circuit covers for regular matroids with a nowhere zero 5-flow
- Packing and covering with matroid circuits
- Short cycle covers and the cycle double cover conjecture
- On shortest \(T\)-joins and packing \(T\)-cuts
- Matroids with the circuit cover property
- Shortest circuit covers of signed graphs
- Short signed circuit covers of signed graphs
- Integer 4-flows and cycle covers
- Approximating minimum-cost connected \(T\)-joins
- Circuit Double Cover of Graphs
- Signed Graphs and Geometry
- Circuit Covers of Signed Graphs
- Covering Multigraphs by Simple Circuits
- Covering Graphs by Simple Circuits
- On the Complexity of Finding a Minimum Cycle Cover of a Graph
- Circuit covers of cubic signed graphs
- Matching, Euler tours and the Chinese postman
- Shorter signed circuit covers of graphs
- Polyhedral decompositions of cubic graphs
This page was built for publication: Minimum $T$-Joins and Signed-Circuit Covering
