Triangle-free subcubic graphs with minimum bipartite density
From MaRDI portal
Publication:2483477
DOI10.1016/J.JCTB.2007.09.001zbMATH Open1154.05053OpenAlexW2026975675MaRDI QIDQ2483477FDOQ2483477
Authors: Xingxing Yu, Baogang Xu 
Publication date: 28 April 2008
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2007.09.001
Recommendations
Cites Work
- Title not available (Why is that?)
- Some simplified NP-complete graph problems
- Problems and results on judicious partitions
- Node-and edge-deletion NP-complete problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Finding a Maximum Cut of a Planar Graph in Polynomial Time
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximumk-colorable subgraphs
- Largest bipartite subgraphs in triangle-free graphs with maximum degree three
- Extremal bipartite subgraphs of cubic triangle-free graphs
- Improved approximation of Max-Cut on graphs of bounded degree
- Title not available (Why is that?)
Cited In (25)
- Maximum bisections of graphs without short even cycles
- On judicious partitions of uniform hypergraphs
- A bound for judicious \(k\)-partitions of graphs
- New formulae for the bipartite vertex frustration and decycling number of graphs
- Maximum directed cuts in digraphs with degree restriction
- Bipartite Subgraphs of Triangle-Free Graphs
- Graph partitioning: an updated survey
- Bipartite density of triangle-free subcubic graphs
- Maximum cuts of graphs with forbidden cycles
- Maximum bisections of graphs without cycles of length 4
- A bound on judicious bipartitions of directed graphs
- Maximum bipartite subgraphs of cubic triangle-free planar graphs
- A note on bipartite subgraphs of triangle‐free graphs
- Judicious partitioning of hypergraphs with edges of size at most 2
- Bisections of graphs without short cycles
- On maximum edge cuts of connected digraphs
- On judicious bipartitions of directed graphs
- On bisections of directed graphs
- Partitioning digraphs with outdegree at least 4
- On a bipartition problem of Bollobás and Scott
- Bounds for pairs in judicious partitioning of graphs
- Maximum directed cuts in graphs with degree constraints
- Bipartite density of cubic graphs
- On a problem of judicious \(k\)-partitions of graphs
- Bipartite subgraphs of triangle-free subcubic graphs
This page was built for publication: Triangle-free subcubic graphs with minimum bipartite density
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483477)
