Some applications of the Nash-Williams lemma to the edge-reconstruction conjecture
type: Item
instance of: scholarly article
title: Some applications of the Nash-Williams lemma to the edge-reconstruction conjecture
zbMATH Open document ID: 0702.05060
DOI: 10.1007/BF01787478
published in: Graphs and Combinatorics
publication date: 1990-01-01T00:00:00Z
review text: A simple graph G is called fourdegreed if the cardinality of its degree set D(G) is four. It is shown that every fourdegreed graph is edge- reconstructible if either \(\delta\geq 8\) or \(d\geq \log_ 268\), where \(\delta\) and d are the minimum and average degree, respectively.
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 4150214
zbMATH Keywords: edge-reconstructibility
zbMATH Keywords: fourdegreed graph
Wikidata QID: Q122983493
author: Ilia Krasikov
author: Yehuda Roditty
reviewed by: Thomas Andreae
MaRDI profile type: Publication
cites work: Combinatorial reconstruction problems
cites work: Q3797219
cites work: On the reconstruction of a graph from its closure function
cites work: Graphical partially ordered sets
cites work: Balance equations for reconstruction problems
cites work: Bidegreed graphs are edge reconstructible
full work available at URL: https://doi.org/10.1007/bf01787478
OpenAlex ID: W2005598715
description: scientific article; zbMATH DE number 4150214