Non-isomorphic caterpillars with identical subtree data
From MaRDI portal
Publication:2495521
DOI10.1016/j.disc.2006.01.022zbMath1091.05020OpenAlexW2022417421MaRDI QIDQ2495521
Publication date: 30 June 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.01.022
Related Items
Iterated joining of rooted trees, Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves, The minimal number of subtrees with a given degree sequence, On distinguishing trees by their chromatic symmetric functions, Acyclic orientation polynomials and the sink theorem for chromatic symmetric functions, Acyclic orientation polynomials and the sink theorem for chromatic symmetric functions, Factorisation of greedoid polynomials of rooted digraphs
Cites Work