Integer 4-flows and cycle covers
From MaRDI portal
Recommendations
Cites work
- Covering Multigraphs by Simple Circuits
- Covering weighted graphs by even subgraphs
- Double cycle covers and the petersen graph
- Flows and generalized coloring theorems in graphs
- Fulkerson's conjecture and circuit covers
- Nowhere-zero 6-flows
- On Tutte's extension of the four-colour problem
- Polyhedral decompositions of cubic graphs
- Short circuit covers for regular matroids with a nowhere zero 5-flow
- Short cycle covers and the cycle double cover conjecture
- Short cycle covers of cubic graphs
- Short cycle covers of graphs with minimum degree three
- Shortest circuit covers of cubic graphs
- Shortest coverings of graphs with cycles
Cited in
(9)- Integer flows and cycle covers
- Note on integer 4-flows in graphs
- Short cycle covers of graphs with at most 77\% vertices of degree two
- Minimum cycle coverings and integer flows
- Integer flows and subgraph covers
- Minimum \(T\)-joins and signed-circuit covering
- Cubic graphs with no short cycle covers
- Short Cycle Covers of Cubic Graphs and Intersecting 5-Circuits
- On Fan's conjecture about 4-flow
This page was built for publication: Integer 4-flows and cycle covers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1743175)