Minimum cycle coverings and integer flows
From MaRDI portal
Recommendations
Cites work
Cited in
(24)- Integer flows and cycle covers
- Extensions of flow theorems
- The construction and reduction of strong snarks
- Shortest circuit covers of signed graphs
- Cycle cover property and \(\text{CPP}=\text{SCC}\) property are not equivalent
- Nowhere-zero 4-flows and cycle double covers
- Cycle double covers and non-separating cycles
- A note about shortest cycle covers
- A cycle cover of a 2-edge-connected graph embedded with large face-width on an orientable surface
- Short cycle covers of graphs and nowhere-zero flows
- Parity Subgraph, Shortest Cycle Cover, and Postman Tour
- scientific article; zbMATH DE number 434907 (Why is no real title available?)
- Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4
- Covering Multigraphs by Simple Circuits
- Cycle covers of graphs with a nowhere-zero 4-flow
- scientific article; zbMATH DE number 475603 (Why is no real title available?)
- Smallest (1, 2)‐eulerian weight and shortest cycle covering
- Graphs with the Circuit Cover Property
- scientific article; zbMATH DE number 1033814 (Why is no real title available?)
- scientific article; zbMATH DE number 1751596 (Why is no real title available?)
- Integer flows and subgraph covers
- Postman tours and cycle covers
- Signed circuit 6-covers of signed K₄-minor-free graphs
- Tutte's 3-flow conjecture and short cycle covers
This page was built for publication: Minimum cycle coverings and integer flows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3353054)