Finite undirected graphs which are not reconstructible from their large cardinality subgraphs
type: Item
instance of: scholarly article
title: Finite undirected graphs which are not reconstructible from their large cardinality subgraphs
zbMATH Open document ID: 0759.05067
DOI: 10.1016/0012-365X(92)90689-D
author: Václav Nýdl
published in: Discrete Mathematics
publication date: 1993-01-17T00:00:00Z
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 97516
zbMATH Keywords: finite undirected graphs
zbMATH Keywords: reconstructible
zbMATH Keywords: large cardinality subgraphs
MaRDI profile type: Publication
cites work: Symmetric relations (undirected graphs) with given semigroups
cites work: Q3684155
cites work: Q3208855
full work available at URL: 0012-365x(92)90689-d
OpenAlex ID: W2138847496
description: scientific article; zbMATH DE number 97516