Pages that link to "Item:Q1843571"
From MaRDI portal
The following pages link to A characterization of convertible (0,1)-matrices (Q1843571):
Displayed 20 items.
- The complexity of computing the permanent (Q600247) (← links)
- Minimally non-Pfaffian graphs (Q947729) (← links)
- The symbiotic relationship of combinatorics and matrix theory (Q1183182) (← links)
- 2-factor Hamiltonian graphs. (Q1403914) (← links)
- Strong orientations without even directed circuits (Q1584319) (← links)
- A new proof of a characterisation of Pfaffian bipartite graphs (Q1826958) (← links)
- Combinatorial analysis. (Matrix problems, choice theory) (Q1837183) (← links)
- A characterisation of Pfaffian near bipartite graphs (Q1850543) (← links)
- Regular bipartite graphs with all 2-factors isomorphic (Q1880796) (← links)
- Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians (Q1883410) (← links)
- On convertible complex matrices (Q1906778) (← links)
- Sign-nonsingular skew-symmetric matrices (Q1915617) (← links)
- Convertible, nearly decomposable, and nearly reducible matrices (Q2365691) (← links)
- A quadratic identity for the number of perfect matchings of plane graphs (Q2378519) (← links)
- Replacing Pfaffians and applications (Q2383534) (← links)
- On maximal sign-nonsingular matrices (Q2564945) (← links)
- Enumeration of perfect matchings of a type of Cartesian products of graphs (Q2581564) (← links)
- On convertible (0,1)-matrices (Q3672116) (← links)
- On the number of dissimilar pfaffian orientations of graphs (Q4680728) (← links)
- On maximal convertible matrices (Q4838120) (← links)