A census of non-reconstructable digraphs. I: Six related families
type: Item
instance of: scholarly article
title: A census of non-reconstructable digraphs. I: Six related families
zbMATH Open document ID: 0426.05039
DOI: 10.1016/S0095-8956(81)80027-5
author: Paul K. Stockmeyer
published in: Journal of Combinatorial Theory. Series B
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 3663184
zbMATH Keywords: non-reconstructable digraphs
zbMATH Keywords: graph reconstruction conjecture
MaRDI profile type: Publication
cites work: On nonreconstructable tournaments
cites work: Graph reconstruction—a survey
cites work: On the problem of reconstructing a tournament from subtournaments
cites work: Reconstructing the degree pair sequence of a digraph
cites work: Determining connectedness from subdigraphs
cites work: The falsity of the reconstruction conjecture for tournaments
cites work: Q3259049
full work available at URL: s0095-8956(81)80027-5
OpenAlex ID: W2021673437
description: scientific article; zbMATH DE number 3663184