Pages that link to "Item:Q4975587"
From MaRDI portal
The following pages link to BIPARTITE SUBGRAPHS OF -FREE GRAPHS (Q4975587):
Displaying 15 items.
- Bipartite subgraphs of integer weighted graphs (Q1381843) (← links)
- On subgraph complementation to \(H\)-free Graphs (Q2088585) (← links)
- Maximum bisections of graphs without cycles of length 4 (Q2142653) (← links)
- Maximum cuts in \(\mathscr{H} \)-free graphs (Q2227990) (← links)
- Maximum bisections of graphs without short even cycles (Q2229167) (← links)
- A note on bipartite subgraphs of triangle‐free graphs (Q3990224) (← links)
- Bipartite Subgraphs of Triangle-Free Graphs (Q4296525) (← links)
- (Q4503094) (← links)
- MAXIMUM CUTS IN GRAPHS WITHOUT WHEELS (Q4968449) (← links)
- Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming (Q5001844) (← links)
- Maximum bipartite subgraphs in $H$-free graphs (Q5867125) (← links)
- MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS (Q6082046) (← links)
- Graph partitioning: an updated survey (Q6110873) (← links)
- Maximum bisections of graphs with girth at least six (Q6640955) (← links)
- Maximum bisections of graphs without cycles of length four and five (Q6648263) (← links)