On problems about judicious bipartitions of graphs

DOI10.1016/j.jctb.2019.03.001zbMath1428.05250arXiv1701.07162OpenAlexW2963270131WikidataQ128156166 ScholiaQ128156166MaRDI QIDQ2338639

Jie Ma, Xingxing Yu, Yuliang Ji, Juan Yan

Publication date: 21 November 2019

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

Full work available at URL: https://arxiv.org/abs/1701.07162

zbMATH Keywords

degree sequencebipartitionbisectioncomplete \(k\)-partite graph\( \ell_\lambda \)-norm

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Maximum bisections of graphs without short even cycles ⋮ On balanced bipartitions of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact bounds for judicious partitions of graphs
• Algorithms for constructing graphs and digraphs with given valences and factors
• Bipartite subgraphs
• Internal Partitions of Regular Graphs
• Graphic Sequences Have Realizations Containing Bisections of Large Degree
• Problems and results on judicious partitions
• Better Bounds for k-Partitions of Graphs
• Some Extremal Properties of Bipartite Subgraphs
• On judicious bipartitions of graphs

This page was built for publication: On problems about judicious bipartitions of graphs