Novak, Ladislav A.; Gibbons, Alan Superperfect pairs of trees in graphs. (English) Zbl 0777.05044 Int. J. Circuit Theory Appl. 21, No. 2, 183-189 (1993). The authors define a superperfect pair of trees and show that maximally distant pairs are superperfect pairs. An algorithm is described to find a superperfect pair from a given arbitrary tree. Reviewer: H.T.Lau (Verdun / Quebec) MSC: 05C05 Trees 05C85 Graph algorithms (graph-theoretic aspects) 68R10 Graph theory (including graph drawing) in computer science Keywords:cutsets; superperfect pair of trees; maximally distant pairs; algorithm × Cite Format Result Cite Review PDF Full Text: DOI References: [1] Kishi, IEEE Trans. Circuit Theory CT-16 pp 323– (1969) [2] Novak, Int. j. cir. theor. appl. 20 pp 201– (1992) [3] and , Hybrid bases in graphs’, IEEE Trans. Circuits and Systems, submitted. [4] Novak, Int. j. cir. theor. appl. 18 pp 205– (1990) [5] and , Graphs, Networks, and Algorithms, Wiley, New York, 1981. · Zbl 0528.94034 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.