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):
Displayed 14 items.
- 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)
- 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)
- 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)
