The matroid parity problem is a common generalization of the matching problem for graphs. We defined the concept of principal partition of the central minor of a matroid with parity condition into strongly irreducible minors pairs and we showed some of its characteristics. Then we showed a class of matroids whose parity problem now became solvable by using the concept of these strongly irreducible minors pairs.
|Number of pages||10|
|Journal||Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi)|
|Publication status||Published - 1985 Nov|
ASJC Scopus subject areas
- Computer Networks and Communications
- Electrical and Electronic Engineering