Permutations avoiding connected graphs

• Published in: Contributions to discrete mathematics Vol. 12; no. 2
• Main Authors: Sauer, Norbert, Zaguia, Imed
• Format: Journal Article
• Language: English
• Published: 27.11.2017

There is a permutation of the vertices of a tree for which no proper subtree on at least two vertices is mapped to a subtree, if and only if twice the number of its endpoints is less than or equal to the number of points of the tree; Theorem 4.1. The following more general result follows: Let G = (V...