Maximum bisections of graphs without cycles of length four and five

DOI10.1016/J.DAM.2024.08.024MaRDI QIDQ6648263zbMATH OpenFDO

Authors Shu-Fei Wu, Yuanyuan Zhong

Publication date 4 December 2024

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

zbMATH Keywords

matchingcycledegree sequencemax-bisection

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Recommendations

• Maximum bisections of graphs without cycles of length 4
• Maximum bisections of graphs with girth at least six
• Maximum bisections of graphs without short even cycles
• Max-bisections of \(H\)-free graphs

Cites work

• scientific article; zbMATH DE number 3715594 (Why is no real title available?)
• scientific article; zbMATH DE number 3510345 (Why is no real title available?)
• scientific article; zbMATH DE number 1787231 (Why is no real title available?)
• scientific article; zbMATH DE number 3307332 (Why is no real title available?)
• A note on balanced bipartitions
• A note on bipartite subgraphs of triangle‐free graphs
• Bipartite Subgraphs of Triangle-Free Graphs
• Bipartite subgraphs
• Bipartite subgraphs of \(H\)-free graphs
• Bisections of graphs
• Bisections of graphs without \(K_{2, l}\)
• Bisections of graphs without short cycles
• Graph partitioning: an updated survey
• Judicious partitions and related problems
• Max-bisections of \(H\)-free graphs
• MaxCut in ${\bm H)$-Free Graphs
• Maximum bisections of graphs without cycles of length 4
• Maximum bisections of graphs without short even cycles
• Maximum cuts and judicious partitions in graphs without short cycles
• Maximum cuts of graphs with forbidden cycles
• New results for MaxCut in H$H$‐free graphs
• On bisections of directed graphs
• On bisections of graphs without complete bipartite graphs
• On judicious bisections of graphs
• On problems about judicious bipartitions of graphs
• Problems and results on judicious partitions
• Ramanujan graphs
• Some Extremal Properties of Bipartite Subgraphs
• The size of the largest bipartite subgraphs

Cited in

(1)

• Maximum bisections of graphs with girth at least six

This page was built for publication: Maximum bisections of graphs without cycles of length four and five

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