scientific article; zbMATH DE number 3307332
From MaRDI portal
Publication:5588434
zbMath0193.24302MaRDI QIDQ5588434
Publication date: 1967
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Implications of forbidden structures for extremal algorithmic problems ⋮ The Crossing Number of the Cone of a Graph ⋮ Maximum bisections of graphs without cycles of length 4 ⋮ Judicious partitions of hypergraphs ⋮ MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS ⋮ On subgraphs of \(C_{2k}\)-free graphs ⋮ New results for MaxCut in H$H$‐free graphs ⋮ Strong forms of stability from flag algebra calculations ⋮ A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity ⋮ \textsc{Max-Cut} parameterized above the Edwards-Erdős bound ⋮ Making a \(K_4\)-free graph bipartite ⋮ On existence theorems ⋮ On bipartitions of directed graphs with small semidegree ⋮ The bipartite edge frustration of extension of splice and link graphs ⋮ Maximum bipartite subgraphs of cubic triangle-free planar graphs ⋮ Techniques and results on approximation algorithms for packing circles ⋮ Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming ⋮ Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality ⋮ On finite set-systems whose every intersection is a kernel of a star ⋮ How to make a graph bipartite ⋮ The NP-completeness of (1,r)-subcolorability of cubic graphs
