Constructing trees with prescribed cardinalities for the components of their vertex deleted subgraphs

DOI10.1016/0196-6774(85)90041-0zbMath0593.68048OpenAlexW2093351224MaRDI QIDQ3723710

J. Schönheim, Fanica Gavril

Publication date: 1985

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(85)90041-0

zbMATH Keywords

Polynomial time algorithmsfree treestrictly positive integer sequences

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Interchanging branches and similarity in a tree

This page was built for publication: Constructing trees with prescribed cardinalities for the components of their vertex deleted subgraphs