The following pages link to Integer flows and cycle covers (Q1186130):
Displaying 12 items.
- Three-matching intersection conjecture for perfect matching polytopes of small dimensions (Q390921) (← links)
- Decomposition of the flow polynomial (Q1359375) (← links)
- Circuit decompositions and shortest circuit coverings of hypergraphs (Q1743689) (← links)
- Spectral threshold for extremal cyclic edge-connectivity (Q2053673) (← links)
- Circuit covers of signed Eulerian graphs (Q2223467) (← links)
- Fulkerson-covers of hypohamiltonian graphs (Q2345598) (← links)
- A note about shortest cycle covers (Q2581631) (← links)
- Circuit \(k\)-covers of signed graphs (Q2656955) (← links)
- Minimum cycle coverings and integer flows (Q3353054) (← links)
- Cycle covers of graphs with a nowhere-zero 4-flow (Q3984471) (← links)
- Smallest (1, 2)‐eulerian weight and shortest cycle covering (Q4284101) (← links)
- Graphs with the Circuit Cover Property (Q4305925) (← links)
