On the Strong Equitable Vertex 2-Arboricity of Complete Bipartite Graphs
An equitable partition of a graph <i>G</i> is a partition of the vertex set of <i>G</i> such that the sizes of any two parts differ by at most one. The <i>strong equitable vertexk</i>-<i>arboricity</i> of <i>G</i>, denoted by <inline-for...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2020-10-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/8/10/1778 |