Connectivity and Reducibility of Graphs

DOI10.4153/CJM-1962-044-0MaRDI QIDQ3291036zbMATH OpenOpenAlexFDO

Authors D. M. Johnson, A. L. Dulmage, N. S. Mendelsohn

Publication date 1962

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

Full work available at URL https://doi.org/10.4153/cjm-1962-044-0

zbMATH Keywords

topology

Cited in

(7)

• Predicting the structure of sparse orthogonal factors
• A manifold-based approach to sparse global constraint satisfaction problems
• A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations
• Constrained Min-Cut Replication for K-Way Hypergraph Partitioning
• Bigraphs versus digraphs via matrices
• On the semigroup of binary relations on a finite set
• On the Inversion of Sparse Matrices

This page was built for publication: Connectivity and Reducibility of Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3291036)