The Dulmage-Mendelsohn Decomposition for $b$-Matchings
Combinatorics
2016-06-28 v1
Abstract
We establish the theory of the Dulmage-Mendelsohn decomposition for -matchings. The original Dulmage-Mendelsohn decomposition is a classical canonical decomposition of bipartite graphs, which describes the structures of the maximum -matchings and the dual optimizers, i.e., the minimum vertex covers. In this paper, we develop analogical properties, and thus obtain the structure of the maximum -matchings and characterizes the family of -verifying set.
Cite
@article{arxiv.1606.08246,
title = {The Dulmage-Mendelsohn Decomposition for $b$-Matchings},
author = {Nanao Kita},
journal= {arXiv preprint arXiv:1606.08246},
year = {2016}
}