We investigate the structure of graphs in the Caucal hierarchy. We provide criteria concerning the degree of vertices or the length of paths which can be used to show that a given ...
We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge ...
In this paper we study a warranty servicing policy for a class of multi-state deteriorating and repairable products. The manufacturer's decision to repair or replace a failed...
f orderings provide an abstract framework in which to study spaces of orderings of formally real fields. Spaces of orderings of finite chain length are well understood [9] [12]. Th...
We construct a large number of record-breaking binary, ternary and quaternary codes. Our methods involve the study of BCH-codes over larger fields, concatenation, construction X a...