Pages that link to "Item:Q1403922"
From MaRDI portal
The following pages link to Packing odd circuits in Eulerian graphs (Q1403922):
Displaying 21 items.
- A survey on flows in graphs and matroids (Q298967) (← links)
- Displaying blocking pairs in signed graphs (Q499457) (← links)
- Ideal clutters (Q697573) (← links)
- Odd path packings (Q757435) (← links)
- Packing circuits in matroids (Q1013971) (← links)
- A short proof of Seymour's characterization of the matroids with the max-flow min-cut property (Q1403921) (← links)
- Negative (and positive) circles in signed graphs: a problem collection (Q1643910) (← links)
- Optimal packing of even circuits into a \(\text{DK}_ v\) (Q1918209) (← links)
- Ranking tournaments with no errors. II: Minimax relation (Q1985451) (← links)
- Conformal decomposition of integral flows on signed graphs with outer-edges (Q2053688) (← links)
- Ranking tournaments with no errors. I: Structural description (Q2284746) (← links)
- Resolution of indecomposable integral flows on signed graphs (Q2400559) (← links)
- Packing circuits into \(K_N\). (Q2777895) (← links)
- Single commodity-flow algorithms for lifts of graphic and cographic matroids (Q2820860) (← links)
- Packing Odd Circuits (Q3503215) (← links)
- Induced Packing of Odd Cycles in a Planar Graph (Q3652239) (← links)
- Conformal Decomposition of Integral Tensions and Potentials of Signed Graphs (Q4591228) (← links)
- Packing odd <i>T</i>‐joins with at most two terminals (Q4638649) (← links)
- Clean Clutters and Dyadic Fractional Packings (Q5071103) (← links)
- Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs (Q5346553) (← links)
- Critically 3-frustrated signed graphs (Q6635112) (← links)
