Some applications of the Nash-Williams lemma to the edge-reconstruction conjecture (Q914704)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some applications of the Nash-Williams lemma to the edge-reconstruction conjecture |
scientific article; zbMATH DE number 4150214
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some applications of the Nash-Williams lemma to the edge-reconstruction conjecture |
scientific article; zbMATH DE number 4150214 |
Statements
Some applications of the Nash-Williams lemma to the edge-reconstruction conjecture (English)
0 references
1990
0 references
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.
0 references
edge-reconstructibility
0 references
fourdegreed graph
0 references
