scientific article
From MaRDI portal
Publication:3416246
zbMath1110.05084MaRDI QIDQ3416246
Publication date: 19 January 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (45)
On judicious partitions of uniform hypergraphs ⋮ On judicious partitions of graphs ⋮ Judicious partitions of weighted hypergraphs ⋮ Biased partitions and judicious \(k\)-partitions of graphs ⋮ On judicious bipartitions of directed graphs ⋮ Bipartitions of highly connected tournaments ⋮ Judicious partitions of directed graphs ⋮ On several partitioning problems of Bollobás and Scott ⋮ Bounds for pairs in judicious partitioning of graphs ⋮ Partitioning digraphs with outdegree at least 4 ⋮ On bisections of graphs without complete bipartite graphs ⋮ On judicious bisections of graphs ⋮ Graph partitioning: an updated survey ⋮ On tight components and anti-tight components ⋮ Bisections of Graphs Without Short Cycles ⋮ Optimal bisections of directed graphs ⋮ Defective coloring of hypergraphs ⋮ The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs ⋮ Judicious Partitioning of Hypergraphs with Edges of Size at Most 2 ⋮ Maximum cuts of graphs with forbidden cycles ⋮ The dual Cheeger constant and spectra of infinite graphs ⋮ Bisections of graphs ⋮ Balanced Judicious Bipartition is Fixed-Parameter Tractable ⋮ The Bollobás-Thomason conjecture for \(3\)-uniform hypergraphs ⋮ Maximum bisections of graphs without short even cycles ⋮ Judicious partitions of uniform hypergraphs ⋮ Partitioning posets ⋮ On the minimum load coloring problem ⋮ On bipartitions of directed graphs with small semidegree ⋮ A note on balanced bipartitions ⋮ Max \(k\)-cut and judicious \(k\)-partitions ⋮ On judicious bipartitions of graphs ⋮ Bipartitions of oriented graphs ⋮ Judicious \(k\)-partitions of graphs ⋮ MAXIMUM CUTS IN GRAPHS WITHOUT WHEELS ⋮ A bound on judicious bipartitions of directed graphs ⋮ BIPARTITE SUBGRAPHS OF -FREE GRAPHS ⋮ Partitioning 3-uniform hypergraphs ⋮ Balanced Judicious Bipartition is Fixed-Parameter Tractable ⋮ Maximum bipartite subgraphs in graphs without short cycles ⋮ Hypergraph cuts above the average ⋮ On problems about judicious bipartitions of graphs ⋮ Maximum bipartite subgraphs in $H$-free graphs ⋮ On judicious partitions of hypergraphs with edges of size at most 3 ⋮ On bisections of directed graphs
This page was built for publication:
