On judicious bisections of graphs

From MaRDI portal
Revision as of 03:33, 30 January 2024 by Import240129110155 (talk | contribs) (Created automatically from import240129110155)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:402590

DOI10.1016/J.JCTB.2014.01.004zbMath1297.05194OpenAlexW2094939916MaRDI QIDQ402590

Xingxing Yu, Bao-Gang Xu

Publication date: 28 August 2014

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2014.01.004




Related Items (28)

On judicious partitions of uniform hypergraphsOn judicious partitions of graphsJudicious partitions of weighted hypergraphsBiased partitions and judicious \(k\)-partitions of graphsOn judicious bipartitions of directed graphsBounds for pairs in judicious partitioning of graphsPartitioning digraphs with outdegree at least 4On bisections of graphs without complete bipartite graphsGraph partitioning: an updated surveyBisections of Graphs Without Short CyclesPartitioning dense uniform hypergraphsOptimal bisections of directed graphsThe Bollobás--Scott Conjecture for 4-Uniform HypergraphsJudicious Partitioning of Hypergraphs with Edges of Size at Most 2Balanced Judicious Bipartition is Fixed-Parameter TractableMaximum cuts in \(\mathscr{H} \)-free graphsBisections of graphs without \(K_{2, l}\)Bounds for judicious balanced bipartitions of graphsOn bipartitions of directed graphs with small semidegreeAn SDP randomized approximation algorithm for max hypergraph cut with limited unbalanceMax-bisections of \(H\)-free graphsBipartitions of oriented graphsBipartition of graph under degree constraintsOn partitions of \(K_{2, 3}\)-free graphs under degree constraintsOn a Problem of Judiciousk-Partitions of GraphsBalanced Judicious Bipartition is Fixed-Parameter TractableMaximum bipartite subgraphs in graphs without short cyclesOn bisections of directed graphs




Cites Work




This page was built for publication: On judicious bisections of graphs