Pages that link to "Item:Q4968449"
From MaRDI portal
The following pages link to MAXIMUM CUTS IN GRAPHS WITHOUT WHEELS (Q4968449):
Displaying 8 items.
- Decomposition of wheel-and-parachute-free balanced bipartite graphs (Q1900140) (← links)
- Maximum cuts in \(\mathscr{H} \)-free graphs (Q2227990) (← links)
- Edge maximal graphs containing no specific wheels (Q2803746) (← links)
- Extremal graphs without a semi-topological wheel (Q3106269) (← links)
- Maximum cuts of graphs with forbidden cycles (Q4615059) (← links)
- Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming (Q5001844) (← links)
- MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS (Q6082046) (← links)
- Graph partitioning: an updated survey (Q6110873) (← links)