05 Combinatorics
05-04 Explicit machine computation and programs (not the theory of computation or programming) (6 articles)
- : Filling boxes densely and disjointly. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 44 (2003), issue 1, pp. 187-196
- : Extensions of $k$-subsets to $k+1$-subsets - existence versus constructability. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 23 (1982), issue 2, pp. 337-349
- : Finding a spanning tree of a graph with maximal number of terminal vertices. (English). Kybernetika, vol. 9 (1973), issue 5, pp. (357)-360
- : On minimal semirigid relations. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 12 (1971), issue 2, pp. 359-365
- : Über gewisse minimale Systeme von $k$-Tupeln. (German) [On a minimal system of $n$-tuples]. Commentationes Mathematicae Universitatis Carolinae, vol. 11 (1970), issue 3, pp. 397-402
- : Příspěvek k teorii kombinací. (Czech) [Contribution to the theory of combinations]. Časopis pro pěstování matematiky, vol. 88 (1963), issue 2, pp. 129-141
Search
Partner of
