Bisections of graphs without K₂, l

DOI10.1016/J.DAM.2018.12.022MaRDI QIDQ1735680zbMATH OpenOpenAlexFDO

Authors Jing Jin, Baogang 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 graphbisection4-cycle\(K_{2, l}\)balanced \(k\)-partition

Mathematics Subject Classification ID

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

Recommendations

• Max-bisections of \(H\)-free graphs
• On bisections of graphs without complete bipartite graphs
• Bisections of graphs without short cycles
• Maximum bisections of graphs without short even cycles
• On judicious bisections of graphs

Cites work

• scientific article; zbMATH DE number 3510345 (Why is no real title available?)
• A note on balanced bipartitions
• Balanced judicious bipartitions of graphs
• Better balance by being biased: a 0.8776-approximation for {\textsc{Max Bisection}}
• Bipartite Subgraphs of Triangle-Free Graphs
• Bisections of graphs without short cycles
• Bounds for pairs in judicious partitioning of graphs
• Exact bounds for judicious partitions of graphs
• Graph partitions: recent progresses and some open problems
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Judicious partitioning of hypergraphs with edges of size at most 2
• On judicious bisections of graphs
• On tight components and anti-tight components
• Problems and results on judicious partitions
• The RPR2 rounding technique for semidefinite programs
• The size of the largest bipartite subgraphs

Cited in

(10)

• Maximum bisections of graphs without cycles of length 4
• On bisections of graphs without complete bipartite graphs
• Bisections of graphs without short cycles
• Max-bisections of \(H\)-free graphs
• Maximum bisections of graphs without cycles of length four and five
• Bisections of graphs
• Maximum bisections of graphs without short even cycles
• Maximum bisections of graphs with girth at least six
• Graph partitioning: an updated survey
• A note on judicious bisections of graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1735680)