The following pages link to On some weakly bipartite graphs (Q800231):
Displaying 6 items.
- The performance of an eigenvalue bound on the max-cut problem in some classes of graphs (Q686456) (← links)
- On cuts and matchings in planar graphs (Q688915) (← links)
- Optimal cuts in graphs and statistical mechanics (Q967941) (← links)
- Compositions in the bipartite subgraph polytope (Q1199475) (← links)
- Laplacian eigenvalues and the maximum cut problem (Q1319025) (← links)
- Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs (Q2220841) (← links)
