Pages that link to "Item:Q1850611"
From MaRDI portal
The following pages link to A short proof of Guenin's characterization of weakly bipartite graphs (Q1850611):
Displaying 8 items.
- \textsc{max-cut} and containment relations in graphs (Q441861) (← links)
- Ideal clutters (Q697573) (← links)
- Odd-\(K_{4}\)'s in stability critical graphs (Q1045088) (← links)
- A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs (Q1088683) (← links)
- Packing odd circuits in Eulerian graphs (Q1403922) (← links)
- A characterization of weakly bipartite graphs (Q1850558) (← links)
- Single commodity-flow algorithms for lifts of graphic and cographic matroids (Q2820860) (← links)
- max-cut and Containment Relations in Graphs (Q3057609) (← links)