Pages that link to "Item:Q2483477"
From MaRDI portal
The following pages link to Triangle-free subcubic graphs with minimum bipartite density (Q2483477):
Displaying 17 items.
- On judicious partitions of uniform hypergraphs (Q272317) (← links)
- A bound for judicious \(k\)-partitions of graphs (Q477337) (← links)
- On a bipartition problem of Bollobás and Scott (Q624186) (← links)
- Bipartite density of triangle-free subcubic graphs (Q1028464) (← links)
- Maximum directed cuts in graphs with degree constraints (Q1926032) (← links)
- New formulae for the bipartite vertex frustration and decycling number of graphs (Q2008493) (← links)
- Maximum bisections of graphs without cycles of length 4 (Q2142653) (← links)
- On judicious bipartitions of directed graphs (Q2144584) (← links)
- Maximum bisections of graphs without short even cycles (Q2229167) (← links)
- A bound on judicious bipartitions of directed graphs (Q2303909) (← links)
- On bisections of directed graphs (Q2357220) (← links)
- Bipartite subgraphs of triangle-free subcubic graphs (Q2519015) (← links)
- Bounds for pairs in judicious partitioning of graphs (Q2951883) (← links)
- Maximum cuts of graphs with forbidden cycles (Q4615059) (← links)
- On a Problem of Judicious<i>k</i>-Partitions of Graphs (Q4978292) (← links)
- On Maximum Edge Cuts of Connected Digraphs (Q5418765) (← links)
- Partitioning digraphs with outdegree at least 4 (Q6056760) (← links)
