Bipartite Subgraphs of Triangle-Free Graphs
From MaRDI portal
Recommendations
- Bipartite subgraphs of triangle-free subcubic graphs
- A note on bipartite subgraphs of triangle‐free graphs
- A note on bipartite subgraphs of triangle-free regular graphs
- Bipartite subgraphs of H-free graphs
- A note on triangle-free and bipartite graphs
- Bipartite density of triangle-free subcubic graphs
- A note on bipartite subgraphs and triangle-independent sets
- Triangle-free subcubic graphs with minimum bipartite density
- Bipartite subgraphs
- On Subgraphs of the Complete Bipartite Graph
Cited in
(43)- Biregular subgraphs of biregular graphs
- Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality
- Bipartite subgraphs of integer weighted graphs
- Maximum cuts and judicious partitions in graphs without short cycles
- Bisections of graphs without \(K_{2, l}\)
- Bipartite algebraic graphs without quadrilaterals
- A note on triangle-free and bipartite graphs
- Dense induced bipartite subgraphs in triangle-free graphs
- Maximum bipartite subgraphs in graphs without short cycles
- The Erdős-Hajnal conjecture for three colors and triangles
- Maximum bisections of graphs without cycles of length 4
- Bipartite induced density in triangle-free graphs
- Maximum cuts in \(\mathscr{H} \)-free graphs
- Maximum bisections of graphs without short even cycles
- Max-bisections of \(H\)-free graphs
- Hypergraph cuts above the average
- A note on bipartite subgraphs and triangle-independent sets
- Bipartite subgraphs
- Some results on chromatic number as a function of triangle count
- Lovász, vectors, graphs and codes
- On a product dimension of bipartite graphs
- A note on bipartite subgraphs of triangle-free regular graphs
- Judicious partitions of directed graphs
- Largest bipartite subgraphs in triangle-free graphs with maximum degree three
- A note on bipartite subgraphs of triangle‐free graphs
- Bisections of graphs without short cycles
- Maximum cuts of graphs with forbidden cycles
- Bisections of graphs
- Problems and results on judicious partitions
- Maximum cuts in graphs without wheels
- Bipartite subgraphs of H-free graphs
- Lower bounds for max-cut in H-free graphs via semidefinite programming
- The -Ramsey problem for triangle-free graphs
- Maximum bipartite subgraphs in H-free graphs
- Graph partitioning: an updated survey
- New results for MaxCut in H$H$‐free graphs
- Maximum bisections of graphs with girth at least six
- Maximum bisections of graphs without cycles of length four and five
- On existence theorems
- Dense induced bipartite subgraphs in H-free graphs
- Some lower bounds for maximum colored cuts
- On maximum bisections of \(\{C_4, \theta (2, 3, 3)\}\)-free graphs
- MaxCut in graphs with sparse neighborhoods
This page was built for publication: Bipartite Subgraphs of Triangle-Free Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4296525)
