The following pages link to Maximumk-colorable subgraphs (Q3931416):
Displaying 17 items.
- Bisections of graphs (Q461728) (← links)
- The bipartite edge frustration of extension of splice and link graphs (Q988725) (← links)
- Maximum bipartite subgraphs of cubic triangle-free planar graphs (Q1011782) (← links)
- Bipartite density of triangle-free subcubic graphs (Q1028464) (← links)
- Max-cut in circulant graphs (Q1201272) (← links)
- Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality (Q1297468) (← links)
- Parsimonious edge coloring (Q1910535) (← links)
- New formulae for the bipartite vertex frustration and decycling number of graphs (Q2008493) (← links)
- On parsimonious edge-colouring of graphs with maximum degree three (Q2376086) (← links)
- Bounds on the bisection width for random \(d\)-regular graphs (Q2381523) (← links)
- Triangle-free subcubic graphs with minimum bipartite density (Q2483477) (← links)
- Bipartite subgraphs of triangle-free subcubic graphs (Q2519015) (← links)
- Judicious partitions of bounded‐degree graphs (Q4474279) (← links)
- Maximum cuts of graphs with forbidden cycles (Q4615059) (← links)
- Problems and results on judicious partitions (Q4798176) (← links)
- MAXIMUM CUTS IN GRAPHS WITHOUT WHEELS (Q4968449) (← links)
- On a Problem of Judicious<i>k</i>-Partitions of Graphs (Q4978292) (← links)
