The following pages link to On some weakly bipartite graphs (Q800231):
Displaying 16 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)
- On bipartite graphs with weak density of some subgraphs (Q878650) (← links)
- Optimal cuts in graphs and statistical mechanics (Q967941) (← links)
- Some optimization problems on weak-bisplit graphs (Q1029034) (← links)
- On weakly diamond-free Berge graphs (Q1126205) (← 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)
- Weakly clique irreducibility of NEPS of two graphs (Q2870971) (← links)
- (Q3567536) (← links)
- (Q3789606) (← links)
- (Q3809836) (← links)
- On Principal Graphs and Weak Duality. (Q4318055) (← links)
- (Q4510346) (← links)
- On bipartite‐mixed graphs (Q4646945) (← links)