Notes on equitable partitions into matching forests in mixed graphs and into b-branchings in digraphs
An equitable partition into branchings in a digraph is a partition of the arc set into branchings such that the sizes of any two branchings differ at most by one. For a digraph whose arc set can be partitioned into k branchings, there always exists an equitable partition into k branchings. In this p...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics and Theoretical Computer Science
2022
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher |