Maximumk-colorable subgraphs
From MaRDI portal
Cites work
Cited in
(18)- Maximum bipartite subgraphs of cubic triangle-free planar graphs
- Bipartite density of triangle-free subcubic graphs
- Max-cut in circulant graphs
- Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality
- Parsimonious edge coloring
- New formulae for the bipartite vertex frustration and decycling number of graphs
- On parsimonious edge-colouring of graphs with maximum degree three
- Bounds on the bisection width for random \(d\)-regular graphs
- Triangle-free subcubic graphs with minimum bipartite density
- Bipartite subgraphs of triangle-free subcubic graphs
- Judicious partitions of bounded‐degree graphs
- Maximum cuts of graphs with forbidden cycles
- Bisections of graphs
- Problems and results on judicious partitions
- Maximum cuts in graphs without wheels
- On a problem of judicious k-partitions of graphs
- Monotonic decompositions of submodular set functions
- The bipartite edge frustration of extension of splice and link graphs
This page was built for publication: Maximumk-colorable subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3931416)