Q4027185
type: Item
instance of: scholarly article
zbMATH Open document ID: 0774.05068
author: Václav Nýdl
publication date: 1993-02-21T00:00:00Z
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 125483
zbMATH Keywords: irreconstructability
zbMATH Keywords: \(m\)-indistinguishable graphs
zbMATH Keywords: isomorphism
zbMATH Keywords: induced subgraphs
MaRDI profile type: Publication
Recommended article: Finite undirected graphs which are not reconstructible from their large cardinality subgraphs
Recommended article: Unavoidable induced subgraphs in large graphs with no homogeneous sets
Recommended article: Graphs with unavoidable subgraphs with large degrees
Recommended article: Q3689207
Recommended article: Unavoidable Induced Subgraphs of Large 2-Connected Graphs
Recommended article: On graphs with subgraphs having large independence numbers
Recommended article: Reconstructing graphs from size and degree properties of their induced \(k\)-subgraphs
Recommended article: Q3794226
Recommended article: Size reconstructibility of graphs
Recommended article: On decomposing graphs of large minimum degree into locally irregular subgraphs
description: scientific article