Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Blocking and anti-blocking pairs of polyhedra
- Facets of the Bipartite Subgraph Polytope
- Finding a Maximum Cut of a Planar Graph in Polynomial Time
- Multi-Commodity Network Flows
- On the cut polytope
- The ellipsoid method and its consequences in combinatorial optimization
- The matroids with the max-flow min-cut property
- The max-cut problem on graphs not contractible to \(K_ 5\)
- Weakly bipartite graphs and the max-cut problem
Cited in
(16)- Weakly clique irreducibility of NEPS of two graphs
- On bipartite‐mixed graphs
- Laplacian eigenvalues and the maximum cut problem
- Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs
- scientific article; zbMATH DE number 4079483 (Why is no real title available?)
- The performance of an eigenvalue bound on the max-cut problem in some classes of graphs
- On bipartite graphs with weak density of some subgraphs
- Some optimization problems on weak-bisplit graphs
- On cuts and matchings in planar graphs
- On Principal Graphs and Weak Duality.
- Compositions in the bipartite subgraph polytope
- On weakly diamond-free Berge graphs
- Optimal cuts in graphs and statistical mechanics
- scientific article; zbMATH DE number 4053666 (Why is no real title available?)
- scientific article; zbMATH DE number 1521521 (Why is no real title available?)
- scientific article; zbMATH DE number 5722250 (Why is no real title available?)
This page was built for publication: On some weakly bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q800231)
