This article surveys results on maximal k-degenerate graphs, k-trees, and related classes
including simple k-trees, k-paths, maximal outerplanar graphs, and Apollonian networks …

We consider the problem of coding labeled trees by means of strings of node labels.
Different codes have been introduced in the literature by Prüfer, Neville, and Deo and …

The problem of coding labeled trees has been widely studied in the literature and several
bijective codes that realize associations between labeled trees and sequences of labels …

This paper introduces the oriented-tree network design problem (OTNDP), a general
problem of tree network design with several applications in different fields. We also present …

In this paper, we propose a new representation for k-trees-the compact code, which reduces
the required memory space from O (nk) to O (n). The encoding and decoding algorithms …

Trees are probably the most studied class of graphs in Computer Science. In this thesis we
study bijective codes that represent labeled trees by means of string of node labels. We …

This thesis deals with algorithmic aspects of communication in networks. The main focus of
the thesis is to find factors which can influence significantly the efficiency in performing a …