Maximum bisections of graphs without adjacent quadrilaterals

DOI10.1007/S00373-025-02889-7MaRDI QIDQ7031900zbMATH OpenFDO

Authors Qiming Hu, Baogang Xu

Publication date 6 February 2025

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00373-025-02889-7

zbMATH Keywords

\(C_6\)-free graphsbipartitionbisection

Mathematics Subject Classification ID

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

Cites work

• A note on balanced bipartitions
• A note on bipartite subgraphs of triangle‐free graphs
• Bipartite subgraphs
• Bipartite subgraphs of integer weighted graphs
• Bisections of graphs without short cycles
• scientific article; zbMATH DE number 3510345 (Why is no real title available?)
• Judicious partitions and related problems
• MaxCut in ${\bm H)$-Free Graphs
• Maximum bipartite subgraphs in graphs without short cycles
• Maximum bisections of graphs without cycles of length 4
• Maximum bisections of graphs without short even cycles
• Maximum cuts of graphs with forbidden cycles
• On bisections of directed graphs
• On bisections of graphs without complete bipartite graphs
• Some Extremal Properties of Bipartite Subgraphs

Cited in

(1)

• On maximum bisections of \(\{C_4, \theta (2, 3, 3)\}\)-free graphs

This page was built for publication: Maximum bisections of graphs without adjacent quadrilaterals

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