Minimum cycle coverings and integer flows
From MaRDI portal
Publication:3353054
DOI10.1002/jgt.3190140504zbMath0729.05041OpenAlexW2024194834MaRDI QIDQ3353054
Publication date: 1990
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190140504
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (9)
Shortest circuit covers of signed graphs ⋮ A cycle cover of a 2-edge-connected graph embedded with large face-width on an orientable surface ⋮ The construction and reduction of strong snarks ⋮ Smallest (1, 2)‐eulerian weight and shortest cycle covering ⋮ Nowhere-zero 4-flows and cycle double covers ⋮ Postman tours and cycle covers ⋮ Graphs with the Circuit Cover Property ⋮ Cycle double covers and non-separating cycles ⋮ A note about shortest cycle covers
Cites Work
This page was built for publication: Minimum cycle coverings and integer flows
