Short circuit covers for regular matroids with a nowhere zero 5-flow

DOI10.1016/0095-8956(87)90011-6zbMath0659.05038OpenAlexW2056535500MaRDI QIDQ1112053

Michael Tarsi, Andre Raspaud, Ury Jamshy

Publication date: 1987

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(87)90011-6

zbMATH Keywords

total lengthregular matroidnowhere zero 5-flow

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (12)

Shortest circuit covers of signed graphs ⋮ A cycle cover of a 2-edge-connected graph embedded with large face-width on an orientable surface ⋮ Short cycle covers of cubic graphs ⋮ Minimum $T$-Joins and Signed-Circuit Covering ⋮ Signed cycle double covers ⋮ Integer 4-flows and cycle covers ⋮ Circuit decompositions and shortest circuit coverings of hypergraphs ⋮ Short cycle covers and the cycle double cover conjecture ⋮ Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties ⋮ Graphs with the Circuit Cover Property ⋮ Short Cycle Covers on Cubic Graphs by Choosing a 2-Factor ⋮ A note about shortest cycle covers

Cites Work

• Shortest coverings of graphs with cycles
• Nowhere zero flow and circuit covering in regular matroids
• Flows and generalized coloring theorems in graphs
• A Class Of Abelian Groups
• A Contribution to the Theory of Chromatic Polynomials
• Unnamed Item

This page was built for publication: Short circuit covers for regular matroids with a nowhere zero 5-flow