@article {IOPORT.00729923,
    author       = {Martinov, Nikola},
    title        = {External locally-tree-like graphs.},
    year         = {1990},
    journal      = {Godishnik na Sofijskiya Universitet ``Sv. Kliment Okhridski''. Fakultet po Matematika i Informatika},
    volume       = {84},
    number       = {1},
    issn         = {0205-0808},
    pages        = {17-22},
    publisher    = {Universitetsko Izdatelstvo ``Sv. Kliment Okhridski'', Sofia},
    abstract     = {Summary: We deal with the set $\text{LT}\sb 1$ of those locally-tree-like graphs, which have a minimal number of edges with respect to the number of vertices. Different characteristics of the class $\text{LT}\sb 1$ are found. If $G$ is an arbitrary graph in $\text{LT}\sb 1$, we find its linear arboricity $\Xi(G)$, i.e. the minimal number of vertex disjoint systems of simple chains covering $G$. It is proved that $\Xi(G)= \left[{\Delta(G)+ 1\over 2}\right]$.},
    identifier   = {00729923},
}