Maximum bisections of graphs without cycles of length 4

DOI10.1016/j.disc.2022.112914zbMath1495.05266OpenAlexW4226366626WikidataQ114190522 ScholiaQ114190522MaRDI QIDQ2142653

Mengjiao Rao, Qinghou Zeng, Jian-Feng Hou

Publication date: 27 May 2022

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

Full work available at URL: https://doi.org/10.1016/j.disc.2022.112914

zbMATH Keywords

cycledegreebisection\(\theta\) graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bisections of graphs
• A note on balanced bipartitions
• Bipartitions of oriented graphs
• Max \(k\)-cut and judicious \(k\)-partitions
• On a class of degenerate extremal graph problems
• The size of the largest bipartite subgraphs
• Bipartite subgraphs of integer weighted graphs
• Maximum cuts and judicious partitions in graphs without short cycles
• Maximum bisections of graphs without short even cycles
• Max-bisections of \(H\)-free graphs
• On bisections of directed graphs
• Triangle-free subcubic graphs with minimum bipartite density
• Bipartite subgraphs
• A note on bipartite subgraphs of triangle‐free graphs
• Bipartite Subgraphs of Triangle-Free Graphs
• Bisections of Graphs Without Short Cycles
• Maximum cuts of graphs with forbidden cycles
• Problems and results on judicious partitions
• BIPARTITE SUBGRAPHS OF -FREE GRAPHS
• Some Extremal Properties of Bipartite Subgraphs
• MaxCut in ${\bm H)$-Free Graphs
• On bisections of graphs without complete bipartite graphs

This page was built for publication: Maximum bisections of graphs without cycles of length 4