A characterization of convertible (0,1)-matrices
From MaRDI portal
Publication:1843571
DOI10.1016/0095-8956(75)90048-9zbMath0281.05013OpenAlexW1978655847WikidataQ56806479 ScholiaQ56806479MaRDI QIDQ1843571
Publication date: 1975
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(75)90048-9
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Determinants, permanents, traces, other special matrix functions (15A15) Matrices of integers (15B36) Graph theory (05Cxx)
Related Items (56)
Dimers on the \(3^3 . 4^2\) lattice ⋮ Convertible, nearly decomposable, and nearly reducible matrices ⋮ Regular bipartite graphs with all 2-factors isomorphic ⋮ On the skew-permanental polynomials of orientation graphs ⋮ Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians ⋮ On cycle-nice claw-free graphs ⋮ A quadratic identity for the number of perfect matchings of plane graphs ⋮ Replacing Pfaffians and applications ⋮ Convertible subspaces of Hessenberg-type matrices ⋮ On convertible complex matrices ⋮ Diagram monoids and Graham-Houghton graphs: idempotents and generating sets of ideals ⋮ Sign-nonsingular skew-symmetric matrices ⋮ The complexity of computing the permanent ⋮ Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem ⋮ On maximal convertible matrices ⋮ A conjecture of Norine and Thomas for abelian Cayley graphs ⋮ Pfaffian graphs embedding on the torus ⋮ A generalization of Little's theorem on Pfaffian orientations ⋮ A sufficient condition for Pfaffian graphs on the torus ⋮ The Pfaffian property of graphs on the Möbius strip based on topological resolution ⋮ Excluding a planar matching minor in bipartite graphs ⋮ 2-factor Hamiltonian graphs. ⋮ The Pfaffian property of Cayley graphs on dihedral groups ⋮ Pólya convertibility problem for symmetric matrices ⋮ Computing the permanental polynomials of bipartite graphs by Pfaffian orientation ⋮ Pfaffian orientations for a type of bipartite graph ⋮ Enumeration of perfect matchings of the Cartesian products of graphs ⋮ Pfaffian polyominos on the Klein bottle ⋮ On the Pólya conversion problem for permanents and determinants ⋮ The Pfaffian property of circulant graphs ⋮ The symbiotic relationship of combinatorics and matrix theory ⋮ Face-width of Pfaffian braces and polyhex graphs on surfaces ⋮ An \(O(|E(G)|^2)\) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs ⋮ Minimally non-Pfaffian graphs ⋮ Arithmetic matrix operations that preserve conversion ⋮ The Pfaffian property of Cartesian products of graphs ⋮ On the number of dissimilar pfaffian orientations of graphs ⋮ Spanning trees of 3-uniform hypergraphs ⋮ On essentially 4-edge-connected cubic bricks ⋮ Counting the number of perfect matchings, and generalized decision trees ⋮ The combinatorics of N. G. de Bruijn ⋮ On the permanental polynomials of matrices ⋮ Graph characterization of fully indecomposable nonconvertible (0, 1)-matrices with minimal number of ones ⋮ A new proof of a characterisation of Pfaffian bipartite graphs ⋮ Combinatorial analysis. (Matrix problems, choice theory) ⋮ On maximal sign-nonsingular matrices ⋮ Strong orientations without even directed circuits ⋮ On convertible (0,1)-matrices ⋮ Colouring non-even digraphs ⋮ A characterisation of Pfaffian near bipartite graphs ⋮ Matching theory and Barnette's conjecture ⋮ Construction of nonconvertible \((0,1)\) matrices ⋮ Enumeration of perfect matchings of a type of Cartesian products of graphs ⋮ Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems ⋮ Odd \(K_{3,3}\) subdivisions in bipartite graphs ⋮ Convertible andm-convertible matrices
Cites Work
This page was built for publication: A characterization of convertible (0,1)-matrices
