C. Berge, Two theorems in graph theory, Proceedings of the National Academy of Sciences of the USA, vol.43, pp.842-844, 1957.

P. J. Cameron, Notes on algebraic structures, 2008.

I. S. Duff, On permutations to block triangular form, Journal of the Institute of Mathematics and its Applications, vol.19, pp.339-342, 1977.

I. S. Duff, A. M. Erisman, and J. K. Reid, Direct Methods for Sparse Matrices, 1986.

I. S. Duff and S. Pralet, Strategies for scaling and pivoting for sparse symmetric indefinite problems, SIAM Journal on Matrix Analysis and Applications, vol.27, pp.313-340, 2005.

I. S. Duff and J. K. Reid, An implementation of Tarjan's algorithm for the block triangularization of a matrix, ACM Transactions on Mathematical Software, vol.4, pp.137-147, 1978.

A. L. Dulmage and N. S. Mendelsohn, Coverings of bipartite graphs, Canadian Journal of Mathematics, vol.10, pp.517-534, 1958.

, Two algorithms for bipartite graphs, SIAM Journal on Applied Mathematics, vol.11, pp.183-194, 1963.

E. Lawler, Unabridged reprint of Combinatorial Optimization: Networks and Matroids, Combinatorial Optimization: Networks and Matroids, 1976.

L. Lovasz and M. D. Plummer, Matching Theory, North-Holland Mathematics Studies, 1986.

M. Marcus and H. Minc, Unabridged, unaltered republication of the corrected (1969) printing of the work published by Prindle, 1964.

N. S. Mendelsohn and A. L. Dulmage, Some generalizations of the problem of distinct representatives, Canadian Journal of Mathematics, vol.10, pp.230-241, 1958.

A. Pothen, Sparse null bases and marriage theorems, 1984.

A. Pothen and C. Fan, Computing the block triangular form of a sparse matrix, ACM Transactions on Mathematical Software, pp.303-324, 1990.