Bipartite subgraphs of H-free graphs
From MaRDI portal
Publication:4975587
Recommendations
Cites work
- scientific article; zbMATH DE number 3715594 (Why is no real title available?)
- scientific article; zbMATH DE number 3510345 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 1787231 (Why is no real title available?)
- scientific article; zbMATH DE number 821271 (Why is no real title available?)
- A note on bipartite subgraphs of triangle‐free graphs
- A note on the independence number of triangle-free graphs
- Asymptotic upper bounds for Ramsey functions
- Bipartite Subgraphs of Triangle-Free Graphs
- Bipartite subgraphs
- Bipartite subgraphs of integer weighted graphs
- Cycles in triangle-free graphs of large chromatic number
- Judicious partitions and related problems
- MaxCut in ${\bm H)$-Free Graphs
- Maximum cuts and judicious partitions in graphs without short cycles
- Norm-graphs: Variations and applications
- On the independence number of sparse graphs
- Problems and results on judicious partitions
- The size of the largest bipartite subgraphs
- Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
Cited in
(23)- Topological minors in bipartite graphs
- A note on bipartite subgraphs of triangle‐free graphs
- Bipartite Subgraphs of Triangle-Free Graphs
- scientific article; zbMATH DE number 1501958 (Why is no real title available?)
- Maximum bisections of graphs without cycles of length 4
- Maximum cuts in graphs without wheels
- Maximum cuts of graphs with forbidden cycles
- On subgraph complementation to \(H\)-free Graphs
- Maximum bisections of graphs without cycles of length four and five
- Maximum \(\mathcal{H}\)-free subgraphs
- Maximum bipartite subgraphs in graphs without short cycles
- A note on a Caro-Wei bound for the bipartite independence number in graphs
- scientific article; zbMATH DE number 841651 (Why is no real title available?)
- Bipartite subgraphs of integer weighted graphs
- Lower bounds for max-cut in \(H\)-free graphs via semidefinite programming
- Maximum bisections of graphs without short even cycles
- The number of \(K_{m,m}\)-free graphs
- Maximum bisections of graphs with girth at least six
- Maximum bipartite subgraphs in $H$-free graphs
- MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS
- Maximum cuts in \(\mathscr{H} \)-free graphs
- Bipartite independence number in graphs with bounded maximum degree
- Graph partitioning: an updated survey
This page was built for publication: Bipartite subgraphs of \(H\)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4975587)