Application of a fast simulation method to the estimation of the number of some k-dimensional subspaces over a finite space

By Masol V.   Kuznetsov I.  

Cybernetics and Systems Analysis, Vol. 46, Iss. 3, 2010-05 ,pp. : 405-419

Springer Publishing Company

Access to resources Recommend Favorite

Upper and lower estimates for the number of some k-dimensional subspaces of a given weight over a finite field

By Kuznetsov I.  

Cybernetics and Systems Analysis, Vol. 46, Iss. 6, 2010-11 ,pp. : 900-912

Springer Publishing Company

Access to resources Recommend Favorite

Blocks in k-connected graphs

By Karpov D.  

Journal of Mathematical Sciences, Vol. 126, Iss. 3, 2005-03 ,pp. : 1167-1181

Springer Publishing Company

Access to resources Recommend Favorite

Necessary Edges in k-Chordalisations of Graphs

By Bodlaender Hans L.  

Journal of Combinatorial Optimization, Vol. 7, Iss. 3, 2003-09 ,pp. : 283-290

Springer Publishing Company

Access to resources Recommend Favorite

k-Dependence and Domination in Kings Graphs

By Ionascu Eugen J.   Pritikin Dan   Wright Stephen E.  

American Mathematical Monthly, Vol. 115, Iss. 9, 2008-11 ,pp. : 820-836

Mathematical Association of America

Access to resources Recommend Favorite