دورية أكاديمية
Degree Lists and Connectedness are 3-Reconstructible for Graphs with At Least Seven Vertices
| العنوان: | Degree Lists and Connectedness are 3-Reconstructible for Graphs with At Least Seven Vertices |
|---|---|
| المؤلفون: | Kostochka, Alexandr V.Aff2, Aff3, Nahvi, Mina, West, Douglas B.Aff1, Aff3, Zirlin, Dara |
| المصدر: | Graphs and Combinatorics. 36(3):491-501 |
| قاعدة البيانات: | Springer Nature Journals |
Find this article in full text from Springer Verlag. 
Full Text Finder | تدمد: | 09110119 14355914 |
|---|---|
| DOI: | 10.1007/s00373-020-02131-6 |