Finite undirected graphs which are not reconstructible from their large cardinality subgraphs

DOI10.1016/0012-365X(92)90689-DzbMath0759.05067OpenAlexW2138847496MaRDI QIDQ1201271

Václav Nýdl

Publication date: 17 January 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(92)90689-d

zbMATH Keywords

finite undirected graphslarge cardinality subgraphsreconstructible

Mathematics Subject Classification ID

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

Related Items (5)

Reconstructing the degree sequence of a sparse graph from a partial deck ⋮ Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices ⋮ 2-reconstructibility of strongly regular graphs and 2-partially distance-regular graphs ⋮ Unnamed Item ⋮ 3-regular graphs are 2-reconstructible

Cites Work

• Unnamed Item
• Unnamed Item
• Symmetric relations (undirected graphs) with given semigroups

This page was built for publication: Finite undirected graphs which are not reconstructible from their large cardinality subgraphs