Pages that link to "Item:Q2229167"
From MaRDI portal
The following pages link to Maximum bisections of graphs without short even cycles (Q2229167):
Displaying 12 items.
- Bisections of graphs (Q461728) (← links)
- Graphs without short odd cycles are nearly bipartite (Q1356557) (← links)
- Bisections of graphs without \(K_{2, l}\) (Q1735680) (← links)
- Maximum bipartite subgraphs in graphs without short cycles (Q2078834) (← links)
- Maximum bisections of graphs without cycles of length 4 (Q2142653) (← links)
- Adjacency eigenvalues of graphs without short odd cycles (Q2237217) (← links)
- Max-bisections of \(H\)-free graphs (Q2279266) (← links)
- The maximum spectral radius of \(\{C_3, C_5\}\)-free graphs of given size (Q6046169) (← links)
- Graph partitioning: an updated survey (Q6110873) (← links)
- Optimal bisections of directed graphs (Q6185053) (← links)
- Maximum bisections of graphs with girth at least six (Q6640955) (← links)
- Maximum bisections of graphs without cycles of length four and five (Q6648263) (← links)