The following pages link to (Q3773882):
Displayed 17 items.
- The maximal linear extension theorem in second order arithmetic (Q634769) (← links)
- Unprovability threshold for the planar graph minor theorem (Q638483) (← links)
- The structure of the models of decidable monadic theories of graphs (Q810005) (← links)
- Quickly deciding minor-closed parameters in general graphs (Q854832) (← links)
- On well-quasi-ordering finite structures with labels (Q912875) (← links)
- Exact unprovability results for compound well-quasi-ordered combinatorial classes (Q1006603) (← links)
- On Fraïssé's conjecture for linear orders of finite Hausdorff rank (Q1032636) (← links)
- Constructive complexity (Q1182305) (← links)
- Minimal acyclic forbidden minors for the family of graphs with bounded path-width (Q1322236) (← links)
- On search, decision, and the efficiency of polynomial-time algorithms (Q1342869) (← links)
- Computability-theoretic and proof-theoretic aspects of partial and linear orderings (Q1425651) (← links)
- Algorithms and obstructions for linear-width and related search parameters (Q1582084) (← links)
- Programs from proofs using classical dependent choice (Q2482844) (← links)
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover (Q2576350) (← links)
- Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor (Q3831057) (← links)
- Long finite sequences (Q5940305) (← links)
- Two applications of analytic functors (Q5958294) (← links)