Pages that link to "Item:Q3990224"

The following pages link to A note on bipartite subgraphs of triangle‐free graphs (Q3990224):

Displayed 9 items.

• Making a \(K_4\)-free graph bipartite (Q950329) ‎ (← links)
• Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality (Q1297468) ‎ (← links)
• Regular honest graphs, isoperimetric numbers, and bisection of weighted graphs (Q1306928) ‎ (← links)
• Judicious partitions of graphs (Q1314903) ‎ (← links)
• Maximum cuts and judicious partitions in graphs without short cycles (Q1400968) ‎ (← links)
• Bounds on the bisection width for random \(d\)-regular graphs (Q2381523) ‎ (← links)
• Bipartite subgraphs (Q2563506) ‎ (← links)
• Linear-Time Approximation Algorithms for the Max Cut Problem (Q4290088) ‎ (← links)
• Problems and results on judicious partitions (Q4798176) ‎ (← links)