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

DOI10.1016/0196-6774(85)90041-0MaRDI QIDQ3723710zbMATH OpenOpenAlexFDO

Authors Fanica Gavril, J. Schönheim

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)

Recommendations

• The reconstruction of a tree from its number deck
• scientific article; zbMATH DE number 434894
• scientific article; zbMATH DE number 4031714
• ON THE CLASS-RECONSTRUCTION NUMBER OF TREES
• scientific article; zbMATH DE number 3961006

Cited in

(6)

• Interchanging branches and similarity in a tree
• scientific article; zbMATH DE number 3843769 (Why is no real title available?)
• Constructing Trees in Graphs whose Complement has no K_2,s
• Reconstructibility of trees from subtree size frequencies
• The reconstruction of a tree from its number deck
• A formula vor vertex cuts in \(b\)-trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3723710)