Maximum bisections of graphs without cycles of length four and five

DOI10.1016/J.DAM.2024.08.024MaRDI QIDQ6648263FDOQ6648263

Authors: Shu-Fei Wu, Yuanyuan Zhong 

Publication date: 4 December 2024

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

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

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)

Cites Work

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

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)