Showing papers by "Richard A. Brualdi published in 1984"

TL;DR: Improved bounds are obtained in terms of the diameter of T and the size of a matching in T when G is a tree or a bipartite graph.

TL;DR: In this article, the authors investigated the polytope of doubly stochastic matrices for which y = Dx and determined when there is a positive and a fully indecomposable D.

TL;DR: The chromatic number of a class of matrices of 0's and 1's with given row and column sum vectors is investigated, equivalently the chromatics number of hypergraphs with given degree and dual-degree sequences is investigated.