A characterization of weakly bipartite graphs
From MaRDI portal
Publication:1850558
DOI10.1006/JCTB.2001.2051zbMATH Open1030.05103OpenAlexW2094667324MaRDI QIDQ1850558FDOQ1850558
Publication date: 10 December 2002
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/8b7c175d98d409c42e6b8417a78ef9ef0dfb7a32
Recommendations
- scientific article
- A short proof of Guenin's characterization of weakly bipartite graphs
- Signed analogs of bipartite graphs
- Ideal Binary Clutters, Connectivity, and a Conjecture of Seymour
- Homomorphism bounds of signed bipartite \(K_4\)-minor-free graphs and edge-colorings of \(2k\)-regular \(K_4\)-minor-free multigraphs
Signed and weighted graphs (05C22) Structural characterization of families of graphs (05C75) Graph minors (05C83)
Cites Work
- Title not available (Why is that?)
- A Solution of the Shannon Switching Game
- Matroids and multicommodity flows
- The matroids with the max-flow min-cut property
- A catalog of minimally nonideal matrices
- Ideal 0, 1 matrices
- Combinatorial optimization. Packing and covering
- On the width—length inequality
- Title not available (Why is that?)
- Title not available (Why is that?)
- Weakly bipartite graphs and the max-cut problem
- The max-cut problem on graphs not contractible to \(K_ 5\)
- Compositions in the bipartite subgraph polytope
- Title not available (Why is that?)
- Combinatorial designs and related systems
- The Forbidden Minors of Binary Clutters
- Lehman's forbidden minor characterization of ideal 0-1 matrices
- Title not available (Why is that?)
Cited In (26)
- Idealness of k-wise Intersecting Families
- Idealness and 2-resistant sets
- Idealness of \(k\)-wise intersecting families
- Extended formulations in combinatorial optimization
- Paintshop, odd cycles and necklace splitting
- Tight Cycle Relaxations for the Cut Polytope
- Title not available (Why is that?)
- Title not available (Why is that?)
- A survey on flows in graphs and matroids
- \textsc{max-cut} and containment relations in graphs
- On bipartite graphs with weak density of some subgraphs
- Extended formulations in combinatorial optimization
- Title not available (Why is that?)
- Lehman's Theorem and the Directed Steiner Tree Problem
- Packing odd circuits in Eulerian graphs
- Resistant Sets in the Unit Hypercube
- Even-cycle decompositions of graphs with no odd-\(K_4\)-minor
- Single commodity-flow algorithms for lifts of graphic and cographic matroids
- Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs
- A short proof of Guenin's characterization of weakly bipartite graphs
- Solving VLSI design and DNA sequencing problems using bipartization of graphs
- Polyhedral results for the bipartite induced subgraph problem
- max-cut and Containment Relations in Graphs
- Displaying blocking pairs in signed graphs
- Min orderings and list homomorphism dichotomies for signed and unsigned graphs
- On fractional cut covers
This page was built for publication: A characterization of weakly bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850558)
