Recognizing trees from incomplete decks

DOI10.1002/JGT.23274MaRDI QIDQ6924605zbMATH OpenFDO

Authors Gabriëlle Zwaneveld

Publication date 29 September 2025

Published in Journal of Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1002/JGT.23274

zbMATH Keywords

boundsdeckgraph reconstructionmissing cardsrecognizabilitytrees

Mathematics Subject Classification ID

Trees (05C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites work

• A congruence theorem for trees
• Families of pairs of graphs with a large number of common cards
• scientific article; zbMATH DE number 3141308 (Why is no real title available?)
• scientific article; zbMATH DE number 4154485 (Why is no real title available?)
• On Ulam's conjecture for separable graphs
• Recognizing connectedness from vertex-deleted subgraphs
• Reconstructibility and perfect graphs
• Size reconstructibility of graphs
• The reconstruction of maximal planar graphs. II: Reconstruction
• The reconstruction of outerplanar graphs

This page was built for publication: Recognizing trees from incomplete decks

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