Maximum bisections of graphs with girth at least six
From MaRDI portal
Publication:6640955
DOI10.1007/s00373-024-02848-8MaRDI QIDQ6640955
Publication date: 20 November 2024
Published in: Graphs and Combinatorics (Search for Journal in Brave)
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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On judicious bisections of graphs
- Bisections of graphs
- A note on balanced bipartitions
- Ramanujan graphs
- The size of the largest bipartite subgraphs
- Maximum cuts and judicious partitions in graphs without short cycles
- Bisections of graphs without \(K_{2, l}\)
- Two proximal splitting methods for multi-block separable programming with applications to stable principal component pursuit
- On partitions of \(K_{2, 3}\)-free graphs under degree constraints
- Maximum bisections of graphs without cycles of length 4
- Maximum bisections of graphs without short even cycles
- Max-bisections of \(H\)-free graphs
- On problems about judicious bipartitions of graphs
- On bisections of directed graphs
- Bipartite subgraphs
- VLSI Physical Design: From Graph Partitioning to Timing Closure
- 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
- Graph partitioning: an updated survey
- New results for MaxCut in H$H$‐free graphs
This page was built for publication: Maximum bisections of graphs with girth at least six
