Maximum bisections of graphs with girth at least six

DOI10.1007/S00373-024-02848-8MaRDI QIDQ6640955FDOQ6640955

Authors: Shu-Fei Wu, Xiaobei Xiong 

Publication date: 20 November 2024

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

Recommendations

• Maximum bisections of graphs without cycles of length four and five
• Maximum bisections of graphs without short even cycles
• Maximum bisections of graphs without cycles of length 4
• Bisections of graphs without short cycles

zbMATH Keywords

cyclegirthdegreebisection

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) 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
• VLSI physical design. From graph partitioning to timing closure
• 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
• 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
• Two proximal splitting methods for multi-block separable programming with applications to stable principal component pursuit
• 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
• On partitions of \(K_{2, 3}\)-free graphs under degree constraints
• 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 without cycles of length four and five

This page was built for publication: Maximum bisections of graphs with girth at least six

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