Pages that link to "Item:Q5663873"
From MaRDI portal
The following pages link to Effective Matchmaking (Recursion Theoretic Aspects of a Theorem of Philip Hall) (Q5663873):
Displayed 14 items.
- Computing planarity in computable planar graphs (Q503647) (← links)
- Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes (Q579241) (← links)
- \(A\)-computable graphs (Q904145) (← links)
- Recursively presented games and strategies (Q1196205) (← links)
- Hamiltonian paths in infinite graphs (Q1196345) (← links)
- Countable thin \(\Pi^0_1\) classes (Q1208080) (← links)
- Marriage in denumerable societies (Q1219283) (← links)
- Index sets for \(\Pi^0_1\) classes (Q1295386) (← links)
- A theory of nonmonotonic rule systems. II (Q1354038) (← links)
- On the complexity of finding the chromatic number of a recursive graph. I: The bounded case (Q1825865) (← links)
- One-transversal families (Q4085726) (← links)
- Recursive Euler and Hamilton Paths (Q4091988) (← links)
- Computable paradoxical decompositions (Q5084297) (← links)
- On the strength of marriage theorems and uniformity (Q5419204) (← links)