Some graphical properties of matrices with non-negative entries

DOI10.1007/BF01817698zbMath0174.26702OpenAlexW2088748724MaRDI QIDQ2532578

N. S. Mendelsohn, A. L. Dulmage

Publication date: 1969

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/182322

zbMATH Keywords

topology

Related Items (6)

A generalization of interval edge-colorings of graphs ⋮ Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs ⋮ Common Partial Transversals and Integral Matrices ⋮ Rado's theorem for polymatroids ⋮ Bounded colouring motivated by the limited resource partially concurrent open shop problem ⋮ Investigations on an edge coloring problem

Cites Work

• Unnamed Item
• The Term and Stochastic Ranks of a Matrix
• Coverings of Bipartite Graphs
• The Convex Hull of Sub-Permutation Matrices
• Two Algorithms for Bipartite Graphs

This page was built for publication: Some graphical properties of matrices with non-negative entries