Pages that link to "Item:Q911300"
From MaRDI portal
The following pages link to Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs (Q911300):
Displaying 37 items.
- Diagram monoids and Graham-Houghton graphs: idempotents and generating sets of ideals (Q346439) (← links)
- Face-width of Pfaffian braces and polyhex graphs on surfaces (Q490246) (← 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)
- Spanning trees of 3-uniform hypergraphs (Q720597) (← links)
- The combinatorics of N. G. de Bruijn (Q740470) (← links)
- Computing the inertia from sign patterns (Q877192) (← links)
- Solving linear programs from sign patterns (Q927161) (← links)
- Sign-solvable linear complementarity problems (Q929486) (← links)
- Minimally non-Pfaffian graphs (Q947729) (← links)
- Pfaffian labelings and signs of edge colorings (Q949785) (← links)
- Recognizing near-bipartite Pfaffian graphs in polynomial time (Q987672) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- Extending matchings in graphs: A survey (Q1322235) (← links)
- Strong orientations without even directed circuits (Q1584319) (← links)
- Convertible subspaces of Hessenberg-type matrices (Q1649076) (← links)
- The number of matrices with nonzero permanent over a finite field (Q1662013) (← links)
- An \(O(|E(G)|^2)\) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs (Q1743482) (← links)
- On the Gibson barrier for the Pólya problem (Q1930200) (← links)
- A generalization of Little's theorem on Pfaffian orientations (Q1931399) (← links)
- Colouring non-even digraphs (Q2094875) (← links)
- Matching theory and Barnette's conjecture (Q2099486) (← links)
- Arithmetic matrix operations that preserve conversion (Q2255512) (← links)
- Oriented Euler complexes and signed perfect matchings (Q2340282) (← links)
- Pfaffian orientations for a type of bipartite graph (Q2437778) (← links)
- Minimal bricks (Q2496202) (← links)
- Generating bricks (Q2642014) (← links)
- A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs (Q3503547) (← links)
- On the complexity of feedback set problems in signed digraphs (Q3503560) (← links)
- The Even Cycle Problem for Directed Graphs (Q3993798) (← links)
- On the number of dissimilar pfaffian orientations of graphs (Q4680728) (← links)
- Even Orientations and Pfaffian graphs (Q5087677) (← links)
- (Q5095316) (← links)
- The Cubic Vertices of Minimal Bricks (Q5418766) (← links)
- Minimal braces (Q6055406) (← links)
- Minimum degree of minimal \((n-10)\)-factor-critical graphs (Q6197704) (← links)
- Shortest odd paths in undirected graphs with conservative weight functions (Q6611004) (← links)
