The following pages link to (Q3793731):
Displaying 8 items.
- NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems (Q1120597) (← links)
- Every 7-regular digraph contains an even cycle (Q1123202) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- On the theory of Pfaffian orientations. II: \(T\)-joins, \(k\)-cuts, and duality of enumeration (Q1277144) (← links)
- Regularity of matrices in min-algebra and its time-complexity (Q1346691) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- On the number of dissimilar pfaffian orientations of graphs (Q4680728) (← links)
- Even Orientations and Pfaffian graphs (Q5087677) (← links)
