Set recognition of decomposable graphs and steps towards their reconstruction

DOI10.1007/s12188-021-00252-0zbMath1490.05187OpenAlexW4206183930MaRDI QIDQ2673544

Yanyan Li

Publication date: 10 June 2022

Published in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12188-021-00252-0

zbMATH Keywords

cardgraphdecomposableset reconstructionset recognition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Lexicographic products with high reconstruction numbers
• Pseudo-similar points in ordered sets
• On reconstructing graphs from their sets of subgraphs
• What is reconstruction for ordered sets?
• Non-reconstructible locally finite graphs
• Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
• Topics in Graph Automorphisms and Reconstruction
• Reconstruction from the deck of ‐vertex induced subgraphs
• Transitiv orientierbare Graphen
• Reconstruction of Trees

This page was built for publication: Set recognition of decomposable graphs and steps towards their reconstruction