Pages that link to "Item:Q1971908"
From MaRDI portal
The following pages link to Permanents, Pfaffian orientations, and even directed circuits (Q1971908):
Displaying 50 items.
- Odd \(K_{3,3}\) subdivisions in bipartite graphs (Q256986) (← links)
- On the skew-permanental polynomials of orientation graphs (Q284839) (← links)
- Diagram monoids and Graham-Houghton graphs: idempotents and generating sets of ideals (Q346439) (← links)
- Pfaffian graphs embedding on the torus (Q382787) (← links)
- Finding kernels or solving SAT (Q414435) (← links)
- On spanning galaxies in digraphs (Q415275) (← links)
- The characteristic polynomial and the matchings polynomial of a weighted oriented graph (Q417494) (← links)
- The Pfaffian property of circulant graphs (Q479041) (← links)
- Face-width of Pfaffian braces and polyhex graphs on surfaces (Q490246) (← links)
- Odd properly colored cycles in edge-colored graphs (Q507513) (← links)
- Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem (Q602719) (← links)
- On the Pólya permanent problem over finite fields (Q607375) (← links)
- Matching signatures and Pfaffian graphs (Q626770) (← links)
- Equilibria of graphical games with symmetries (Q627165) (← links)
- Packing directed circuits exactly (Q663091) (← links)
- The combinatorics of N. G. de Bruijn (Q740470) (← links)
- On the permanental polynomials of matrices (Q745925) (← links)
- Computing the inertia from sign patterns (Q877192) (← links)
- Thin edges in braces (Q888627) (← links)
- Solving linear programs from sign patterns (Q927161) (← links)
- Sign-solvable linear complementarity problems (Q929486) (← links)
- Minimally non-Pfaffian graphs (Q947729) (← links)
- Recognizing near-bipartite Pfaffian graphs in polynomial time (Q987672) (← links)
- 2-extendability of toroidal polyhexes and Klein-bottle polyhexes (Q1003671) (← links)
- 2-factor Hamiltonian graphs. (Q1403914) (← links)
- On the hardness of efficiently approximating maximal non-\(L\) submatrices. (Q1418978) (← links)
- Strong orientations without even directed circuits (Q1584319) (← links)
- Dimers on the \(3^3 . 4^2\) lattice (Q1619468) (← links)
- Convertible subspaces of Hessenberg-type matrices (Q1649076) (← links)
- A sufficient condition for Pfaffian graphs on the torus (Q1684942) (← links)
- Binary linear codes, dimers and hypermatrices (Q1687777) (← links)
- Matching connectivity: on the structure of graphs with perfect matchings (Q1689965) (← links)
- Out-degree reducing partitions of digraphs (Q1704574) (← links)
- Pfaffian polyominos on the Klein bottle (Q1713983) (← links)
- Positive and negative cycles in Boolean networks (Q1717061) (← links)
- Binary linear codes via 4D discrete Ihara-Selberg function (Q1733566) (← links)
- An \(O(|E(G)|^2)\) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs (Q1743482) (← links)
- Augmenting tractable fragments of abstract argumentation (Q1761284) (← links)
- A new proof of a characterisation of Pfaffian bipartite graphs (Q1826958) (← links)
- A characterisation of Pfaffian near bipartite graphs (Q1850543) (← links)
- Max-algebra: The linear algebra of combinatorics? (Q1873718) (← 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 the even permutation polytope (Q1887623) (← links)
- A generalization of Little's theorem on Pfaffian orientations (Q1931399) (← links)
- The Pfaffian property of Cartesian products of graphs (Q2015792) (← links)
- Minimum \(k\)-critical bipartite graphs (Q2043356) (← links)
- Counting the number of perfect matchings, and generalized decision trees (Q2044128) (← links)
- Pfaffian pairs and parities: counting on linear matroid intersection and parity problems (Q2061881) (← links)
- Colouring non-even digraphs (Q2094875) (← links)
