The following pages link to MaxCut in ${\bm H)$-Free Graphs (Q5704383):
Displaying 22 items.
- Making a \(K_4\)-free graph bipartite (Q950329) (← links)
- Dense induced bipartite subgraphs in triangle-free graphs (Q2003768) (← links)
- Maximum bipartite subgraphs in graphs without short cycles (Q2078834) (← 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)
- Max-bisections of \(H\)-free graphs (Q2279266) (← links)
- Hypergraph cuts above the average (Q2327966) (← links)
- Modular Orientations of Random and Quasi-Random Regular Graphs (Q2998847) (← links)
- Lovász, Vectors, Graphs and Codes (Q3295262) (← links)
- Judicious partitions of directed graphs (Q3467583) (← links)
- Maximum cuts of graphs with forbidden cycles (Q4615059) (← links)
- MAXIMUM CUTS IN GRAPHS WITHOUT WHEELS (Q4968449) (← links)
- BIPARTITE SUBGRAPHS OF -FREE GRAPHS (Q4975587) (← links)
- Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming (Q5001844) (← links)
- (Q5009538) (← links)
- Maximum bipartite subgraphs in $H$-free graphs (Q5867125) (← links)
- MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS (Q6082046) (← links)
- Making an H $H$‐free graph k $k$‐colorable (Q6093148) (← links)
- Lower Bounds for Maximum Weighted Cut (Q6100613) (← links)
- New results for MaxCut in H$H$‐free graphs (Q6134889) (← links)
- Kalai's conjecture in \(r\)-partite \(r\)-graphs (Q6181994) (← links)
