On the public citation graph
Exact Bounds for Judicious Partitions of Graphs
0 signed · 71 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/eujc.1998.0266openalex-snapshot
Judicious Partitions of 3-uniform Hypergraphs
inferredcites →https://doi.org/10.1006/jcta.1996.2744openalex-snapshot
Judicious Partitions of Hypergraphs
inferredcites →https://doi.org/10.1016/0012-365x(82)90040-1openalex-snapshot
Triangle-free partial graphs and edge covering theorems
inferredcites →https://doi.org/10.1016/0095-8956(88)90057-3openalex-snapshot
How to make a graph bipartite
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.10174openalex-snapshot
Judicious partitions of bounded‐degree graphs
inferred← citeshttps://doi.org/10.1002/jgt.20421openalex-snapshot
Balanced judicious bipartitions of graphs
inferred← citeshttps://doi.org/10.1002/jgt.22094openalex-snapshot
On a Problem of Judiciousk-Partitions of Graphs
inferred← citeshttps://doi.org/10.1002/jgt.22715openalex-snapshot
Partitioning digraphs with outdegree at least 4
inferred← citeshttps://doi.org/10.1002/jgt.22717openalex-snapshot
On bisections of graphs without complete bipartite graphs
inferred← citeshttps://doi.org/10.1002/rsa.10062openalex-snapshot
Problems and results on judicious partitions
inferred← citeshttps://doi.org/10.1002/rsa.20579openalex-snapshot
Judicious partitions of directed graphs
inferred← citeshttps://doi.org/10.1002/rsa.20642openalex-snapshot
Bounds for pairs in judicious partitioning of graphs
inferred← citeshttps://doi.org/10.1002/rsa.21175openalex-snapshot
Optimal bisections of directed graphs
inferred← citeshttps://doi.org/10.1007/s00373-018-1949-xopenalex-snapshot
Bounds for Judicious Balanced Bipartitions of Graphs
inferred← citeshttps://doi.org/10.1007/s00373-020-02189-2openalex-snapshot
Maximum Cuts in $$\mathscr {H}$$-Free Graphs
inferred← citeshttps://doi.org/10.1007/s00493-009-2381-xopenalex-snapshot
On a bipartition problem of Bollobás and Scott
inferred← citeshttps://doi.org/10.1007/s00493-012-2696-xopenalex-snapshot
The Bollobás-Thomason conjecture for 3-uniform hypergraphs
inferred← citeshttps://doi.org/10.1007/s00493-014-2916-7openalex-snapshot
Judicious partitions of uniform hypergraphs
inferred← citeshttps://doi.org/10.1007/s00493-015-2944-yopenalex-snapshot
On judicious bipartitions of graphs
inferred← citeshttps://doi.org/10.1007/s10114-016-6043-9openalex-snapshot
Biased partitions and judicious k-partitions of graphs
inferred← citeshttps://doi.org/10.1007/s10878-015-9828-3openalex-snapshot
On judicious partitions of graphs
inferred← citeshttps://doi.org/10.1007/s11425-015-5039-8openalex-snapshot
Judicious partitions of weighted hypergraphs
inferred← citeshttps://doi.org/10.1016/j.aml.2012.04.015openalex-snapshot
Simple probabilistic analysis to generalize bottleneck graph multi-partitioning
inferred← citeshttps://doi.org/10.1016/j.dam.2014.07.002openalex-snapshot
A bound for judicious k -partitions of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.12.022openalex-snapshot
Bisections of graphs without K2,l
inferred← citeshttps://doi.org/10.1016/j.disc.2010.03.023openalex-snapshot
Bounds for pairs in partitions of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2010.03.029openalex-snapshot
A note on balanced bipartitions
inferred← citeshttps://doi.org/10.1016/j.disc.2010.04.004openalex-snapshot
Max k -cut and judicious k -partitions
inferred← citeshttps://doi.org/10.1016/j.disc.2011.11.030openalex-snapshot
Upper bounds on minimum balanced bipartitions
inferred← citeshttps://doi.org/10.1016/j.disc.2018.08.015openalex-snapshot
On partitions of K2,3 -free graphs under degree constraints
inferred← citeshttps://doi.org/10.1016/j.disc.2022.112988openalex-snapshot
On judicious bipartitions of directed graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115349openalex-snapshot
A note on judicious partition of hypergraphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2019.103039openalex-snapshot
On bipartitions of directed graphs with small semidegree
inferred← citeshttps://doi.org/10.1016/j.jcta.2016.02.004openalex-snapshot
On judicious partitions of uniform hypergraphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2008.08.007openalex-snapshot
Judicious k-partitions of graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2010.06.002openalex-snapshot
On several partitioning problems of Bollobás and Scott
inferred← citeshttps://doi.org/10.1016/j.jctb.2011.07.001openalex-snapshot
Partitioning 3-uniform hypergraphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2014.01.004openalex-snapshot
On judicious bisections of graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2018.03.003openalex-snapshot
Bipartitions of oriented graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.03.001openalex-snapshot
On problems about judicious bipartitions of graphs
inferred← citeshttps://doi.org/10.1016/s0095-8956(03)00028-5openalex-snapshot
Partitions of graphs with high minimum degree or connectivity
inferred← citeshttps://doi.org/10.1016/s0095-8956(03)00036-4openalex-snapshot
Maximum cuts and judicious partitions in graphs without short cycles
inferred← citeshttps://doi.org/10.1017/cbo9780511734885.006openalex-snapshot
Judicious partitions and related problems
inferred← citeshttps://doi.org/10.1017/s000497272400008xopenalex-snapshot
A NOTE ON JUDICIOUS BISECTIONS OF GRAPHS
inferred← citeshttps://doi.org/10.1017/s0963548306007723openalex-snapshot
Edge Distribution of Graphs with Few Copies of a Given Graph
inferred← citeshttps://doi.org/10.1017/s0963548306007863openalex-snapshot
Maximizing Several Cuts Simultaneously
inferred← citeshttps://doi.org/10.1017/s0963548311000204openalex-snapshot
Better Bounds for k-Partitions of Graphs
inferred← citeshttps://doi.org/10.1017/s0963548316000274openalex-snapshot
Judicious Partitioning of Hypergraphs with Edges of Size at Most 2
inferred← citeshttps://doi.org/10.1017/s0963548317000487openalex-snapshot
Bisections of Graphs Without Short Cycles
inferred← citeshttps://doi.org/10.1080/09728600.2022.2148589openalex-snapshot
Graph partitioning: an updated survey
inferred← citeshttps://doi.org/10.1088/1742-6596/1769/1/012043openalex-snapshot
Bisection of Hamilton Plane Graphs under Girth Constraints
inferred← citeshttps://doi.org/10.1103/physreve.95.062310openalex-snapshot
Spectral partitioning in equitable graphs
inferred← citeshttps://doi.org/10.1137/17m1128484openalex-snapshot
The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs
inferred← citeshttps://doi.org/10.1137/17m1155612openalex-snapshot
Balanced Judicious Bipartition is Fixed-Parameter Tractable
inferred← citeshttps://doi.org/10.1142/s1793830914500207openalex-snapshot
MAXIMUM BALANCED 3-PARTITIONS OF GRAPHS
inferred← citeshttps://doi.org/10.1145/1597036.1597049openalex-snapshot
Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function
inferred← citeshttps://doi.org/10.11606/t.45.2019.tde-15032019-114236openalex-snapshot
Densidade local em grafos
inferred← citeshttps://doi.org/10.1184/r1/6477671openalex-snapshot
Judicious partitions of directed graphs
inferred← citeshttps://doi.org/10.11845/sxjz.2015001aopenalex-snapshot
Graph Partitions:Recent Progresses and Some Open Problems
inferred← citeshttps://doi.org/10.1360/scm-2017-0605openalex-snapshot
Bounds for $\boldsymbol{l}$-tuples in judicious partition of hypergraphs and graphs
inferred← citeshttps://doi.org/10.21136/cmj.2017.0147-16openalex-snapshot
Bounds for the number of meeting edges in graph partitioning
inferred← citeshttps://doi.org/10.2139/ssrn.7330469openalex-snapshot
Vertex Partitions under Size-Adaptive Degree Constraints
inferred← citeshttps://doi.org/10.26493/1855-3974.1218.5edopenalex-snapshot
Maximum cuts of graphs with forbidden cycles
inferred← citeshttps://doi.org/10.48550/arxiv.0911.0563openalex-snapshot
Judicious partitions of 3-uniform hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1710.05491openalex-snapshot
Balanced Judicious Partition is Fixed-Parameter Tractable
inferred← citeshttps://doi.org/10.48550/arxiv.math/0404503openalex-snapshot
Edge distribution of graphs with few induced copies of a given graph
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.