Minimal Interchanges of (0, 1)-Matrices and Disjoint Circuits in a Graph

DOI10.4153/CJM-1965-081-0zbMath0141.00803MaRDI QIDQ5515363

David W. Walkup

Publication date: 1965

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

combinatorics

Related Items

Constructing (0,1)-matrices with large minimal defining sets ⋮ Matrices of zeros and ones with fixed row and column sum vectors ⋮ Defining Sets and Critical Sets in (0,1)‐Matrices ⋮ On d-invariant transformations of (\(p,s\))-digraphs ⋮ Disjoint cycles in Eulerian digraphs and the diameter of interchange graphs

This page was built for publication: Minimal Interchanges of (0, 1)-Matrices and Disjoint Circuits in a Graph