Maximum cuts of graphs with forbidden cycles
From MaRDI portal
Publication:4615059
DOI10.26493/1855-3974.1218.5edzbMath1404.05092OpenAlexW2884541885WikidataQ129337862 ScholiaQ129337862MaRDI QIDQ4615059
Publication date: 1 February 2019
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.26493/1855-3974.1218.5ed
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (10)
Maximum bisections of graphs without cycles of length 4 ⋮ MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS ⋮ Making an H $H$‐free graph k $k$‐colorable ⋮ Graph partitioning: an updated survey ⋮ New results for MaxCut in H$H$‐free graphs ⋮ Maximum bisections of graphs without short even cycles ⋮ Max-bisections of \(H\)-free graphs ⋮ MAXIMUM CUTS IN GRAPHS WITHOUT WHEELS ⋮ Maximum bipartite subgraphs in graphs without short cycles ⋮ Maximum bipartite subgraphs in $H$-free graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A bound for judicious \(k\)-partitions of graphs
- Max \(k\)-cut and judicious \(k\)-partitions
- Judicious \(k\)-partitions of graphs
- Bipartite subgraphs of integer weighted graphs
- Maximum cuts and judicious partitions in graphs without short cycles
- Cycles in triangle-free graphs of large chromatic number
- The independence number of graphs with a forbidden cycle and Ramsey numbers
- Exact bounds for judicious partitions of graphs
- Triangle-free subcubic graphs with minimum bipartite density
- Bipartite subgraphs
- On maximal paths and circuits of graphs
- Maximumk-colorable subgraphs
- A note on bipartite subgraphs of triangle‐free graphs
- Bipartite Subgraphs of Triangle-Free Graphs
- Problems and results on judicious partitions
- On a Problem of Judiciousk-Partitions of Graphs
- Better Bounds for k-Partitions of Graphs
- Judicious Partitioning of Hypergraphs with Edges of Size at Most 2
- Some Extremal Properties of Bipartite Subgraphs
- MaxCut in ${\bm H)$-Free Graphs
- Asymptotic upper bounds for Ramsey functions
This page was built for publication: Maximum cuts of graphs with forbidden cycles