Tomescu, Ioan Un algorithme pour l’obtention d’une chaîne Hamiltonienne en partant de l’arbre minimal d’un graphe. (French) Zbl 0322.05129 Rev. Franc. Automat. Inform. Rech. Operat. 9, V-3, 5-12 (1975). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page MSC: 05C35 Extremal problems in graph theory 05C05 Trees 05B20 Combinatorial aspects of matrices (incidence, Hadamard, etc.) 05-04 Software, source code, etc. for problems pertaining to combinatorics PDF BibTeX XML Cite \textit{I. Tomescu}, Rev. Franc. Automat. Inform. Rech. Operat., V 9, No. 3, 5--12 (1975; Zbl 0322.05129) Full Text: EuDML OpenURL