Maximum bipartite subgraphs in graphs without short cycles
type: Item
instance of: scholarly article
title: Maximum bipartite subgraphs in graphs without short cycles
zbMATH Open document ID: 1483.05085
author: Jing Lin
author: Qinghou Zeng
published in: Discrete Applied Mathematics
publication date: 2022-03-04T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 7483878
zbMATH Keywords: bipartite subgraph
zbMATH Keywords: forbidden cycle
zbMATH Keywords: partition
MaRDI profile type: Publication
full work available at URL: j.dam.2021.12.031
OpenAlex ID: W4210432181
cites work: Bipartite subgraphs
cites work: Maximum cuts and judicious partitions in graphs without short cycles
cites work: Bipartite subgraphs of integer weighted graphs
cites work: MaxCut in ${\bm H)$-Free Graphs
cites work: Q4550236
cites work: Problems and results on judicious partitions
cites work: Max \(k\)-cut and judicious \(k\)-partitions
cites work: Some Extremal Properties of Bipartite Subgraphs
cites work: Q4090369
cites work: Q3905312
cites work: On maximal paths and circuits of graphs
cites work: Maximum bisections of graphs without short even cycles
cites work: Maximum cuts in \(\mathscr{H} \)-free graphs
cites work: On several partitioning problems of Bollobás and Scott
cites work: Bipartite Subgraphs of Triangle-Free Graphs
cites work: Q3416246
cites work: A note on bipartite subgraphs of triangle‐free graphs
cites work: Judicious \(k\)-partitions of graphs
cites work: Better Bounds for k-Partitions of Graphs
cites work: On judicious bisections of graphs
cites work: Maximum cuts of graphs with forbidden cycles
DOI: 10.1016/J.DAM.2021.12.031
description: scientific article; zbMATH DE number 7483878