Some Extremal Properties of Bipartite Subgraphs
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Judicious \(k\)-partitions of graphs
- Maximum bipartite subgraphs of cubic triangle-free planar graphs
- A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound
- Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality
- Judicious partitions of graphs
- Judicious partitions of hypergraphs
- The size of the largest bipartite subgraphs
- Bipartite subgraphs of integer weighted graphs
- Maximum cuts and judicious partitions in graphs without short cycles
- Note on maximal bisection above tight lower bound
- Partitioning dense uniform hypergraphs
- On partitions of \(K_{2, 3}\)-free graphs under degree constraints
- Maximum directed cuts in graphs with degree constraints
- Judicious partitions of 3-uniform hypergraphs
- An improved kernel for max-bisection above tight lower bound
- Dense induced bipartite subgraphs in triangle-free graphs
- On bipartitions of directed graphs with small semidegree
- Maximum bipartite subgraphs in graphs without short cycles
- Maximum bisections of graphs without cycles of length 4
- On judicious bipartitions of directed graphs
- Maximum cuts in \(\mathscr{H} \)-free graphs
- Maximum bisections of graphs without short even cycles
- Max-bisections of \(H\)-free graphs
- Fixed-parameter tractable algorithm and polynomial kernel for \textsc{Max-Cut Above Spanning Tree}
- A bound on judicious bipartitions of directed graphs
- Hypergraph cuts above the average
- Eigenvector-based identification of bipartite subgraphs
- On problems about judicious bipartitions of graphs
- On bisections of directed graphs
- Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound
- Bipartite subgraphs
- On the chromatic number of Steiner triple systems of order 25
- Biased partitions and judicious \(k\)-partitions of graphs
- On judicious partitions of uniform hypergraphs
- On judicious partitions of graphs
- Judicious partitions of weighted hypergraphs
- Bounds for pairs in judicious partitioning of graphs
- The crossing number of the cone of a graph
- Study of the bipartite edge frustration of graphs
- Acyclic digraphs
- Lovász, vectors, graphs and codes
- Maximum directed cuts in acyclic digraphs
- Judicious partitions of directed graphs
- Cutting two graphs simultaneously
- Largest bipartite subgraphs in triangle-free graphs with maximum degree three
- Maximumk-colorable subgraphs
- On judicious bisections of graphs
- Upper bounds on minimum balanced bipartitions
- Linear-Time Approximation Algorithms for the Max Cut Problem
- Judicious partitions of bounded‐degree graphs
- The crossing number of the cone of a graph
- Bisections of graphs without short cycles
- The Bollobás-Scott conjecture for 4-uniform hypergraphs
- Maximum cuts of graphs with forbidden cycles
- Bisections of graphs
- A bound for judicious \(k\)-partitions of graphs
- Problems and results on judicious partitions
- A survey of graph laplacians
- \textsc{Max-Cut} parameterized above the Edwards-Erdős bound
- On a problem of judicious k-partitions of graphs
- Lower bounds for max-cut in H-free graphs via semidefinite programming
- Balanced judicious bipartition is fixed-parameter tractable
- Balanced judicious bipartitions of graphs
- Better bounds for \(k\)-partitions of graphs
- Balanced Judicious Bipartition is Fixed-Parameter Tractable
- Judicious partitioning of hypergraphs with edges of size at most 2
- Parameterized traveling salesman problem: beating the average
- Maximum bipartite subgraphs in H-free graphs
- The cut cone. III: On the role of triangle facets
- On judicious bipartitions of graphs
- The cut cone. III: On the role of triangle facets
- On several partitioning problems of Bollobás and Scott
- Partitioning digraphs with outdegree at least 4
- On bisections of graphs without complete bipartite graphs
- MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS
- The bipartite edge frustration of composite graphs
- Making an H H‐free graph k k‐colorable
- Graph partitioning: an updated survey
- New results for MaxCut in H$H$‐free graphs
- Kalai's conjecture in \(r\)-partite \(r\)-graphs
- Optimal bisections of directed graphs
- On a bipartition problem of Bollobás and Scott
- On bipartite restrictions of binary matroids
- The bipartite edge frustration of graphs under subdivided edges and their related sums
- Extremal properties of the bipartite vertex frustration of graphs
- Approximating long cycle above Dirac's guarantee
- Bounds on maximum weight directed cut
- Maximum bisections of graphs with girth at least six
- Maximum bisections of graphs without cycles of length four and five
- A note on judicious bisections of graphs
- Factorization norms and an inverse theorem for MaxCut
- Positive discrepancy, MaxCut, and eigenvalues of graphs
- On existence theorems
- Dense induced bipartite subgraphs in H-free graphs
- An FPT algorithm for splitting a necklace among two thieves
- Maximum colored cuts in edge-colored graphs without short properly cycles
- Bisections of directed graphs without complete bipartite subgraphs
- On ratio-k-cuts of graphs
- Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound
- An FPT algorithm for splitting a necklace among two thieves
This page was built for publication: Some Extremal Properties of Bipartite Subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5668830)
