Bisections of graphs without \(K_{2, l}\)
type: Item
instance of: scholarly article
title: Bisections of graphs without \(K_{2, l}\)
zbMATH Open document ID: 1407.05140
author: Jing Jin
author: Baogang Xu
published in: Discrete Applied Mathematics
publication date: 2019-03-28T00:00:00Z
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 7044575
zbMATH Keywords: triangle
zbMATH Keywords: 4-cycle
zbMATH Keywords: \(K_{2, l}\)
zbMATH Keywords: Eulerian graph
zbMATH Keywords: bisection
zbMATH Keywords: balanced \(k\)-partition
MaRDI profile type: Publication
full work available at URL: j.dam.2018.12.022
OpenAlex ID: W2909489187
cites work: Better Balance by Being Biased
cites work: Problems and results on judicious partitions
cites work: Exact bounds for judicious partitions of graphs
cites work: Q4090369
cites work: The size of the largest bipartite subgraphs
cites work: Bounds for pairs in judicious partitioning of graphs
cites work: Bisections of Graphs Without Short Cycles
cites work: The RPR2 rounding technique for semidefinite programs
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: Judicious Partitioning of Hypergraphs with Edges of Size at Most 2
cites work: On tight components and anti-tight components
cites work: Bipartite Subgraphs of Triangle-Free Graphs
cites work: Graph partitions: recent progresses and some open problems
cites work: Balanced judicious bipartitions of graphs
cites work: A note on balanced bipartitions
cites work: On judicious bisections of graphs
DOI: 10.1016/J.DAM.2018.12.022
description: scientific article; zbMATH DE number 7044575