The following pages link to Covering directed and odd cuts (Q3220093):
Displaying 15 items.
- On T-joins and odd factors (Q579278) (← links)
- A note on parity constrained orientations (Q987565) (← links)
- A quick proof of Seymour's theorem on t-joins (Q1089008) (← links)
- Undirected distances and the postman-structure of graphs (Q1099186) (← links)
- The Schrijver system of odd join polyhedra (Q1101352) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- An application of submodular flows (Q1119596) (← links)
- On orientations and shortest paths (Q1123899) (← links)
- On shortest \(T\)-joins and packing \(T\)-cuts (Q1210583) (← links)
- On a min--max theorem on bipartite graphs (Q1422438) (← links)
- A generalization of Petersen's theorem (Q1801707) (← links)
- Conservative weightings and ear-decompositions of graphs (Q2367443) (← links)
- Tree-compositions and orientations (Q2450662) (← links)
- Finding thet-join structure of graphs (Q3030603) (← links)
- Modulo orientations with bounded out-degrees (Q6080113) (← links)
