Maximum bisections of graphs without cycles of length four and five
From MaRDI portal
Publication:6648263
DOI10.1016/J.DAM.2024.08.024MaRDI QIDQ6648263
Publication date: 4 December 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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}\)
- 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
- 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 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)
