Nowhere zero flow and circuit covering in regular matroids

DOI10.1016/0095-8956(85)90059-0zbMath0584.05018OpenAlexW2059098132MaRDI QIDQ1070235

Michael Tarsi

Publication date: 1985

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(85)90059-0

zbMATH Keywords

nowhere zero flowregular matroidscircuit coverings

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Directed graphs (digraphs), tournaments (05C20)

Related Items (9)

Semi-duality and the cycle double cover conjecture ⋮ Barely lonely runners and very lonely runners: a refined approach to the Lonely Runner Problem ⋮ Short circuit covers for regular matroids with a nowhere zero 5-flow ⋮ Flows, view obstructions, and the lonely runner ⋮ 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 ⋮ Cycle cover ratio of regular matroids ⋮ On shortest cocycle covers of graphs

Cites Work

• Shortest coverings of graphs with cycles
• Flows and generalized coloring theorems in graphs
• Nowhere-zero 6-flows
• On the enumeration of chains in regular chain-groups
• A Class Of Abelian Groups
• Covering Multigraphs by Simple Circuits
• Covering Graphs by Simple Circuits
• A Decomposition for Combinatorial Geometries
• Unnamed Item

This page was built for publication: Nowhere zero flow and circuit covering in regular matroids