Pages that link to "Item:Q4615059"
From MaRDI portal
The following pages link to Maximum cuts of graphs with forbidden cycles (Q4615059):
Displayed 10 items.
- Maximum bipartite subgraphs in graphs without short cycles (Q2078834) (← links)
- Maximum bisections of graphs without cycles of length 4 (Q2142653) (← links)
- Maximum bisections of graphs without short even cycles (Q2229167) (← links)
- Max-bisections of \(H\)-free graphs (Q2279266) (← links)
- MAXIMUM CUTS IN GRAPHS WITHOUT WHEELS (Q4968449) (← 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)
- Graph partitioning: an updated survey (Q6110873) (← links)
- New results for MaxCut in H$H$‐free graphs (Q6134889) (← links)