Bisections of graphs without \(K_{2, l}\)

DOI10.1016/j.dam.2018.12.022zbMath1407.05140OpenAlexW2909489187MaRDI QIDQ1735680

Jing Jin, Bao-Gang Xu

Publication date: 28 March 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.12.022

zbMATH Keywords

triangleEulerian graph4-cyclebisection\(K_{2, l}\)balanced \(k\)-partition

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

On bisections of graphs without complete bipartite graphs ⋮ Graph partitioning: an updated survey ⋮ Max-bisections of \(H\)-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On judicious bisections of graphs
• A note on balanced bipartitions
• On tight components and anti-tight components
• The size of the largest bipartite subgraphs
• Exact bounds for judicious partitions of graphs
• Bounds for pairs in judicious partitioning of graphs
• Bipartite Subgraphs of Triangle-Free Graphs
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Bisections of Graphs Without Short Cycles
• Problems and results on judicious partitions
• Better Balance by Being Biased
• Balanced judicious bipartitions of graphs
• Judicious Partitioning of Hypergraphs with Edges of Size at Most 2
• The RPR2 rounding technique for semidefinite programs

This page was built for publication: Bisections of graphs without \(K_{2, l}\)