Bisections of graphs without K₂, l

DOI10.1016/J.DAM.2018.12.022zbMATH Open1407.05140OpenAlexW2909489187MaRDI QIDQ1735680FDOQ1735680

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

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

zbMATH Keywords

triangleEulerian graphbisection4-cycle\(K_{2, l}\)balanced \(k\)-partition

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

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

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)