
arXiv: 1907.09911
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
12 pages; revised; accepted to Discrete Math
05C15, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), degenerate graph, planar graph, FOS: Mathematics, Mathematics - Combinatorics, equitable partition, Combinatorics (math.CO), induced forest, Planar graphs; geometric and topological aspects of graph theory
05C15, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), degenerate graph, planar graph, FOS: Mathematics, Mathematics - Combinatorics, equitable partition, Combinatorics (math.CO), induced forest, Planar graphs; geometric and topological aspects of graph theory
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 4 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
