Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem
From MaRDI portal
Publication:602719
DOI10.1016/j.jctb.2010.06.003zbMath1208.05112OpenAlexW2027774729MaRDI QIDQ602719
Publication date: 5 November 2010
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2010.06.003
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On matrices which have signed null-spaces
- Computing the inertia from sign patterns
- Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
- Solving linear programs from sign patterns
- Sign-solvable linear complementarity problems
- Sign-nonsingular matrices and even cycles in directed graphs
- Characterization of even directed graphs
- Matching theory
- Combinatorially symmetric matrices
- Nested sequences of principal minors and potential stability
- Some properties of matrices with signed null spaces.
- Linear systems with signed solutions
- Pólya's permanent problem
- A new proof of a characterisation of Pfaffian bipartite graphs
- A characterization of convertible (0,1)-matrices
- Sign patterns that allow diagonalizability
- Permanents, Pfaffian orientations, and even directed circuits
- Coverings of Bipartite Graphs
- Upper degree-constrained partial orientations
- Cycles in digraphs– a survey
- ON THE TWO-COLOURING OF HYPERGRAPHS
- The combinatorially symmetric P-matrix completion problem
- Even dicycles
- Matrices and matroids for systems analysis
This page was built for publication: Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem
