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

DOI10.1016/0012-365X(92)90689-DzbMATH Open0759.05067OpenAlexW2138847496MaRDI QIDQ1201271FDOQ1201271

Authors: 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

Recommendations

• scientific article; zbMATH DE number 125483
• scientific article; zbMATH DE number 3948325
• scientific article; zbMATH DE number 3906535
• Towards size reconstruction from fewer cards
• scientific article; zbMATH DE number 883277

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)

Cites Work

• Title not available (Why is that?)
• Symmetric relations (undirected graphs) with given semigroups
• Title not available (Why is that?)

Cited In (8)

• Title not available (Why is that?)
• 3-regular graphs are 2-reconstructible
• The converse of Kelly's lemma and control-classes in graph reconstruction
• Largest non-unique subgraphs
• 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
• The size of a graph is reconstructible from any \(n-2\) cards
• 2-reconstructibility of strongly regular graphs and 2-partially distance-regular graphs

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

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