Characterizing path-like trees from linear configurations
Document typeConference lecture
Rights accessOpen Access
Assume that we embed the path Pn as a subgraph of a 2-dimensional grid, namely, Pk¿Pl. Given such an embedding, we consider the ordered set of subpaths L1, L2,...,Lm which are maximal straight segments in the embedding, and such that the end of Li is the beginning of Li+1.
CitationLópez, S.C. Characterizing path-like trees from linear configurations. A: British Combinatorial Conference. "26st British Combinatorial Conference: University of Strathclyde, 3th-7th july 2017: abstract booklet". Glasgow: 2017, p. 58.