相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。Bipartitions of oriented graphs
Jianfeng Hou et al.
JOURNAL OF COMBINATORIAL THEORY SERIES B (2018)
THE BOLLOBAS SCOTT CONJECTURE FOR 4-UNIFORM HYPERGRAPHS
Jianfeng Hou et al.
SIAM JOURNAL ON DISCRETE MATHEMATICS (2018)
Bisections of Graphs Without Short Cycles
Genghua Fan et al.
COMBINATORICS PROBABILITY & COMPUTING (2018)
Bounds for Pairs in Judicious Partitioning of Graphs
Genghua Fan et al.
RANDOM STRUCTURES & ALGORITHMS (2017)
On bisections of directed graphs
Jianfeng Hou et al.
EUROPEAN JOURNAL OF COMBINATORICS (2017)
On judicious partitions of uniform hypergraphs
Jianfeng Hou et al.
JOURNAL OF COMBINATORIAL THEORY SERIES A (2016)
Judicious Partitions of Directed Graphs
Choongbum Lee et al.
RANDOM STRUCTURES & ALGORITHMS (2016)
On Tight Components and Anti-Tight Components
Changhong Lu et al.
GRAPHS AND COMBINATORICS (2015)
Bipartition of graph under degree constraints
Liu Muhuo et al.
SCIENCE CHINA-MATHEMATICS (2015)
On Maximum Edge Cuts of Connected Digraphs
Guantao Chen et al.
JOURNAL OF GRAPH THEORY (2014)
An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance
Xu BaoGang et al.
SCIENCE CHINA-MATHEMATICS (2014)
Bisections of graphs
Choongbum Lee et al.
JOURNAL OF COMBINATORIAL THEORY SERIES B (2013)
On several partitioning problems of Bollobas and Scott
Jie Ma et al.
JOURNAL OF COMBINATORIAL THEORY SERIES B (2010)
Bipartite density of triangle-free subcubic graphs
Xuding Zhu
DISCRETE APPLIED MATHEMATICS (2009)
Triangle-free subcubic graphs with minimum bipartite density
Baogang Xu et al.
JOURNAL OF COMBINATORIAL THEORY SERIES B (2008)
Maximum directed cuts in acyclic digraphs
Noga Alon et al.
JOURNAL OF GRAPH THEORY (2007)
Problems and results on judicious partitions
B Bollobás et al.
RANDOM STRUCTURES & ALGORITHMS (2002)
分享论文
