Some applications of the nash-williams lemma to the edge-reconstruction conjecture |
| |
Authors: | I. Krasikov Y. Roditty |
| |
Affiliation: | (1) School of Mathematical Sciences, Tel Aviv University, Tel Aviv, Israel |
| |
Abstract: | It is shown that a graph whose vertices have one of four possible degrees is edgereconstructible if either 8 ord 2log2 68, where andd are the minimum and the average degree of a graph respectively. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|