Graph partitions: recent progresses and some open problems
From MaRDI portal
Recommendations
Cited in
(12)- An isoperimetric lemma
- Partitioning dense uniform hypergraphs
- Bisections of graphs without \(K_{2, l}\)
- Isomorphic bisections of cubic graphs
- An overview of graph covering and partitioning
- Graph partitions with prescribed patterns
- Biased partitions and judicious \(k\)-partitions of graphs
- Sparse balanced partitions and the complexity of subgraph problems
- scientific article; zbMATH DE number 3825881 (Why is no real title available?)
- Graph partitioning: an updated survey
- Dense induced bipartite subgraphs in H-free graphs
- Maximum colored cuts in edge-colored graphs without short properly cycles
This page was built for publication: Graph partitions: recent progresses and some open problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2823421)