Pages that link to "Item:Q1850558"
From MaRDI portal
The following pages link to A characterization of weakly bipartite graphs (Q1850558):
Displaying 25 items.
- A survey on flows in graphs and matroids (Q298967) (← links)
- Solving VLSI design and DNA sequencing problems using bipartization of graphs (Q429453) (← links)
- \textsc{max-cut} and containment relations in graphs (Q441861) (← links)
- Displaying blocking pairs in signed graphs (Q499457) (← links)
- Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs (Q764332) (← links)
- On bipartite graphs with weak density of some subgraphs (Q878650) (← links)
- Paintshop, odd cycles and necklace splitting (Q1028475) (← links)
- Packing odd circuits in Eulerian graphs (Q1403922) (← links)
- A short proof of Guenin's characterization of weakly bipartite graphs (Q1850611) (← links)
- Idealness of \(k\)-wise intersecting families (Q2118114) (← links)
- Idealness and 2-resistant sets (Q2294336) (← links)
- On fractional cut covers (Q2312658) (← links)
- Even-cycle decompositions of graphs with no odd-\(K_4\)-minor (Q2400967) (← links)
- Polyhedral results for the bipartite induced subgraph problem (Q2433802) (← links)
- Single commodity-flow algorithms for lifts of graphic and cographic matroids (Q2820860) (← links)
- max-cut and Containment Relations in Graphs (Q3057609) (← links)
- Lehman's Theorem and the Directed Steiner Tree Problem (Q3462549) (← links)
- (Q3809836) (← links)
- (Q4367811) (← links)
- Resistant Sets in the Unit Hypercube (Q4991667) (← links)
- Tight Cycle Relaxations for the Cut Polytope (Q5020841) (← links)
- Idealness of k-wise Intersecting Families (Q5041730) (← links)
- (Q5488350) (← links)
- Extended formulations in combinatorial optimization (Q5900907) (← links)
- Extended formulations in combinatorial optimization (Q5919994) (← links)
