scientific article; zbMATH DE number 20509

MaRDI QIDQ3979791zbMATH OpenFDO

Authors V. L. Tyurin

Publication date 26 June 1992

zbMATH Keywords

colored treesreconstruction

Mathematics Subject Classification ID

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

Recommendations

• Reconstruction for Colorings on Trees
• Recoloring graphs via tree decompositions
• Note on the reconstruction of vertex colored graphs
• An extended formulation of the convex recoloring problem on a tree
• Building graphs from colored trees
• Reconfiguring vertex colourings of 2-trees
• scientific article; zbMATH DE number 4035877
• Multicolored trees in complete graphs
• Multicolored trees in complete graphs
• On generating series of coloured planar trees

Cited in

(5)

• Reconstruction for Colorings on Trees
• scientific article; zbMATH DE number 434894 (Why is no real title available?)
• ON THE CLASS-RECONSTRUCTION NUMBER OF TREES
• scientific article; zbMATH DE number 913538 (Why is no real title available?)
• Reconstructing trees from two cards

This page was built for publication:

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