Bisections of Graphs Without Short Cycles
From MaRDI portal
Publication:4601051
DOI10.1017/S0963548317000487zbMath1378.05105OpenAlexW2758344425MaRDI QIDQ4601051
Xingxing Yu, Geng-Hua Fan, Jian-Feng Hou
Publication date: 19 January 2018
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548317000487
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)
Related Items
Maximum bisections of graphs without cycles of length 4, The maximum spectral radius of \(\{C_3, C_5\}\)-free graphs of given size, On bisections of graphs without complete bipartite graphs, Graph partitioning: an updated survey, Optimal bisections of directed graphs, Maximum bisections of graphs without short even cycles, Bisections of graphs without \(K_{2, l}\), Adjacency eigenvalues of graphs without short odd cycles, Max-bisections of \(H\)-free graphs, Bipartitions of oriented graphs, On partitions of \(K_{2, 3}\)-free graphs under degree constraints, A bound on judicious bipartitions of directed graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On judicious bisections of graphs
- Bisections of graphs
- On several partitioning problems of Bollobás and Scott
- A note on balanced bipartitions
- On tight components and anti-tight components
- Judicious \(k\)-partitions of graphs
- Bipartite density of triangle-free subcubic graphs
- Judicious partitions of hypergraphs
- The size of the largest bipartite subgraphs
- Maximum cuts and judicious partitions in graphs without short cycles
- Cycles of even length in graphs
- Exact bounds for judicious partitions of graphs
- Triangle-free subcubic graphs with minimum bipartite density
- Bipartite subgraphs
- Bounds for pairs in judicious partitioning of graphs
- Bipartite Subgraphs of Triangle-Free Graphs
- Problems and results on judicious partitions
- Balanced judicious bipartitions 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
- On judicious bipartitions of graphs
