Pages that link to "Item:Q4975587"
From MaRDI portal
The following pages link to BIPARTITE SUBGRAPHS OF -FREE GRAPHS (Q4975587):
Displaying 7 items.
- 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)
- 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)
