EveryH-decomposition ofK n has a Nearly Resolvable Alternative

By Alon N.   Yuster R.  

European Journal of Combinatorics, Vol. 21, Iss. 7, 2000-10 ,pp. : 839-845

Elsevier

Access to resources Recommend Favorite

Every n-generic degree is a minimal cover of an n-generic degree

By  

The Journal of Symbolic Logic, Vol. 58, Iss. 1, 1993-03 ,pp. : 219-231

Cambridge University Press

Access to resources Recommend Favorite

On the Recursive Sequence x n+1 = x n-1 + x n-2 Cx n-1 + Dx n-2

By Kalabu  

Journal of Difference Equations and Applications, Vol. 9, Iss. 8, 2003-08 ,pp. : 701-720

Taylor & Francis Ltd

Access to resources Recommend Favorite

On the Recursive Sequence x n+1 = p + x n-k x n

By DeVault R.   Kent C.   Kosmala W.  

Journal of Difference Equations and Applications, Vol. 9, Iss. 8, 2003-08 ,pp. : 721-730

Taylor & Francis Ltd

Access to resources Recommend Favorite

On the Recursive Sequence x n + 1 = + ( x n - 1 )/(1 + g ( x n ))

By Chang D-C.  

Applicable Analysis, Vol. 82, Iss. 2, 2003-01 ,pp. : 145-156

Taylor & Francis Ltd

Access to resources Recommend Favorite