Pages that link to "Item:Q6134889"
From MaRDI portal
The following pages link to New results for MaxCut in H$H$‐free graphs (Q6134889):
Displaying 5 items.
- MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS (Q6082046) (← links)
- Making an H $H$‐free graph k $k$‐colorable (Q6093148) (← links)
- Maximum bisections of graphs with girth at least six (Q6640955) (← links)
- Orthonormal representations, vector chromatic number, and extension complexity (Q6644170) (← links)
- Maximum bisections of graphs without cycles of length four and five (Q6648263) (← links)
