Notes on Equitable Partition into Matching Forests in Mixed Graphs and into b-branchings in Digraphs

by   Kenjiro Takazawa, et al.
Hosei University

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 paper, we present two extensions of equitable partitions into branchings in digraphs: those into matching forests in mixed graphs; and into b-branchings in digraphs. For matching forests, Király and Yokoi (2018) considered a tricriteria equitability based on the sizes of the matching forest, and the matching and branching therein. In contrast to this, we introduce a single-criterion equitability based on the number of the covered vertices. For b-branchings, we define an equitability based on the size of the b-branching and the indegrees of all vertices. For both matching forests and b-branchings, we prove that equitable partitions always exist.


page 1

page 2

page 3

page 4


Equitable Partitions into Matchings and Coverings in Mixed Graphs

Matchings and coverings are central topics in graph theory. The close re...

A (4/3+ε)-Approximation Algorithm for Arboricity From Pseudoforest Partitions

The arboricity of a graph is the minimum number of forests it can be par...

Information Forests

We describe Information Forests, an approach to classification that gene...

Equitable partition of graphs into induced linear forests

It is proved that the vertex set of any simple graph G can be equitably ...

Formal Dependability Modeling and Optimization of Scrubbed-Partitioned TMR for SRAM-based FPGAs

SRAM-based FPGAs are popular in the aerospace industry for their field p...

Please sign up or login with your details

Forgot password? Click here to reset