Equitable partition of planar graphs
| Autor: | Kim, Ringi, Oum, Sang-il, Zhang, Xin |
|---|---|
| Rok vydání: | 2019 |
| Předmět: | |
| Zdroj: | Discrete Math., 344(6):112351, June 2021 |
| Druh dokumentu: | Working Paper |
| DOI: | 10.1016/j.disc.2021.112351 |
| Popis: | An equitable $k$-partition of a graph $G$ is a collection of induced subgraphs $(G[V_1],G[V_2],\ldots,G[V_k])$ of $G$ such that $(V_1,V_2,\ldots,V_k)$ is a partition of $V(G)$ and $-1\le |V_i|-|V_j|\le 1$ for all $1\le i |
| Databáze: | arXiv |
| Externí odkaz: |
|