Coverings of Bipartite Graphs

DOI10.4153/CJM-1958-052-0zbMath0091.37404WikidataQ55891585 ScholiaQ55891585MaRDI QIDQ3266931

N. S. Mendelsohn, A. L. Dulmage

Publication date: 1958

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

zbMATH Keywords

topology

Related Items (84)

A note on minimal matching covered graphs ⋮ A polynomial time solvable instance of the feasible minimum cover problem ⋮ Popular Matchings with Two-Sided Preferences and One-Sided Ties ⋮ Matching structure and bargaining outcomes in buyer-seller networks ⋮ Menger-decomposition of a graph and its application to the structural analysis of a large-scale system of equations ⋮ Popular Matchings with Two-Sided Preferences and One-Sided Ties ⋮ Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems— ⋮ Effects of problem decomposition (partitioning) on the rate of convergence of parallel numerical algorithms ⋮ Digraph characterization of structural controllability for linear descriptor systems ⋮ Patterns that preserve sparsity in orthogonal factorization ⋮ Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem ⋮ Independent edges in bipartite graphs obtained from orientations of graphs ⋮ On the fixed controllable subspace in linear structured systems ⋮ A note on sign-solvability of linear system of equations ⋮ A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations ⋮ A graph-theoretic approach to investigate structural and qualitative properties of systems: A survey ⋮ Decomposition theorems for square-free 2-matchings in bipartite graphs ⋮ Unnamed Item ⋮ Combinatorial Canonical Form of Layered Mixed Matrices and Its Application to Block-Triangularization of Systems of Linear/Nonlinear Equations ⋮ Real-time model-based fault detection and isolation for ugvs ⋮ Sensor fault detection and isolation via networked estimation: rank-deficient dynamical systems ⋮ Popular Matchings with Ties and Matroid Constraints ⋮ On bounded block decomposition problems for under-specified systems of equations ⋮ Excluding a planar matching minor in bipartite graphs ⋮ Constrained Min-Cut Replication for K-Way Hypergraph Partitioning ⋮ Making Bipartite Graphs DM-Irreducible ⋮ Matrices of 0's and 1's with total support ⋮ Fair-by-design matching ⋮ On the structure of factorizable graphs. II ⋮ Matrices of zeros and ones ⋮ Partial state observability recovering for linear systems by additional sensor implementation ⋮ Bargaining in a network of buyers and sellers. ⋮ Permutations of a semigroup that map to inverses. ⋮ Local null controllability of the three-dimensional Navier-Stokes system with a distributed control having two vanishing components ⋮ Observability analysis and sensor location study for structured linear systems in descriptor form with unknown inputs ⋮ Dulmage-Mendelsohn canonical decomposition as a generic pruning technique ⋮ A fast algorithm for numerical solutions to Fortet's equation ⋮ Reverse propagation of McCormick relaxations ⋮ How to Secure Matchings against Edge Failures ⋮ Topological conditions for the solvability of linear active networks ⋮ Computing DM-decomposition of a partitioned matrix with rank-1 blocks ⋮ An efficient method for determining fault isolability properties based on an augmented system model ⋮ Geometric Separators for Finite-Element Meshes ⋮ State and input observability recovering by additional sensor implementation: a graph-theoretic approach ⋮ Coverings of transfinite matrices ⋮ A manifold-based approach to sparse global constraint satisfaction problems ⋮ Consensus algorithms for the generation of all maximal bicliques ⋮ Indeterminates and incidence matrices^† ⋮ Ordering techniques for singly bordered block diagonal forms for unsymmetric parallel sparse direct solvers ⋮ Factorization of the minors of characteristic matrix sI-A and DM decomposition of its representation graph ⋮ From structural analysis to observer-based residual generation for fault detection ⋮ Generic methodology for the probabilistic reliability assessment of some structural properties: a graph theoretical approach ⋮ A note on \({\mathtt V}\)-free 2-matchings ⋮ On the truncated assignment polytope ⋮ Combinatorial aspects of rectangular non-negative matrices ⋮ Nontrivial path covers of graphs: existence, minimization and maximization ⋮ Discussion on: ``Structural analysis of the partial state and input observability for structured linear systems: application to distributed systems ⋮ On the point-core of a graph ⋮ Bigraphs versus digraphs via matrices ⋮ Some graphical properties of matrices with non-negative entries ⋮ Use of matroid theory in operations research, circuits and systems theory ⋮ Diagnosing Time-Dependent Incipient Faults ⋮ How to Secure Matchings Against Edge Failures ⋮ \(b\)-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks ⋮ Structural theorems for submodular functions, polymatroids and polymatroid intersections ⋮ Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs ⋮ Scaling matrices and counting the perfect matchings in graphs ⋮ Strong transfinite version of König's duality theorem ⋮ Automated design of an FDI system for the wind turbine benchmark ⋮ Laplacian Preconditioning of Elliptic PDEs: Localization of the Eigenvalues of the Discretized Operator ⋮ Exploiting The Structure of Bipartite Graphs for Algebraic and Spectral Graph Theory Applications ⋮ On fully indecomposable matrices ⋮ Spectral stability of metric-measure Laplacians ⋮ Controllability of Coupled Parabolic Systems with Multiple Underactuations, Part 1: Algebraic Solvability ⋮ Structural Analysis ⋮ A graph theoretical approach to the parameters identifiability characterisation ⋮ Graft analogue of general Kotzig-Lovász decomposition ⋮ GPDOF — A FAST ALGORITHM TO DECOMPOSE UNDER-CONSTRAINED GEOMETRIC CONSTRAINT SYSTEMS: APPLICATION TO 3D MODELING ⋮ Test signal generation for service diagnosis based on local structural properties ⋮ Enumeration of BC-subtrees of trees ⋮ Detection of structural inconsistency in systems of equations with degrees of freedom and its applications ⋮ Disclosing Barriers: A Generalization of the Canonical Partition Based on Lovász’s Formulation ⋮ Predicting the structure of sparse orthogonal factors ⋮ Graphs with unique maximum independent sets

This page was built for publication: Coverings of Bipartite Graphs