Eintrag weiter verarbeiten
N-reconstructibility of non-reconstructible digraphs
Gespeichert in:
Zeitschriftentitel: | Discrete Mathematics |
---|---|
Personen und Körperschaften: | |
In: | Discrete Mathematics, 46, 1983, 3, S. 279-294 |
Format: | E-Article |
Sprache: | Englisch |
veröffentlicht: |
Elsevier BV
|
Schlagwörter: |
author_facet |
Ramachandran, S. Ramachandran, S. |
---|---|
author |
Ramachandran, S. |
spellingShingle |
Ramachandran, S. Discrete Mathematics N-reconstructibility of non-reconstructible digraphs Discrete Mathematics and Combinatorics Theoretical Computer Science |
author_sort |
ramachandran, s. |
spelling |
Ramachandran, S. 0012-365X Elsevier BV Discrete Mathematics and Combinatorics Theoretical Computer Science http://dx.doi.org/10.1016/0012-365x(83)90122-x N-reconstructibility of non-reconstructible digraphs Discrete Mathematics |
doi_str_mv |
10.1016/0012-365x(83)90122-x |
facet_avail |
Online Free |
finc_class_facet |
Mathematik Informatik |
format |
ElectronicArticle |
fullrecord |
blob:ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTAxNi8wMDEyLTM2NXgoODMpOTAxMjIteA |
id |
ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTAxNi8wMDEyLTM2NXgoODMpOTAxMjIteA |
institution |
DE-Zi4 DE-Gla1 DE-15 DE-Pl11 DE-Rs1 DE-14 DE-105 DE-Ch1 DE-L229 DE-D275 DE-Bn3 DE-Brt1 DE-Zwi2 DE-D161 |
imprint |
Elsevier BV, 1983 |
imprint_str_mv |
Elsevier BV, 1983 |
issn |
0012-365X |
issn_str_mv |
0012-365X |
language |
English |
mega_collection |
Elsevier BV (CrossRef) |
match_str |
ramachandran1983nreconstructibilityofnonreconstructibledigraphs |
publishDateSort |
1983 |
publisher |
Elsevier BV |
recordtype |
ai |
record_format |
ai |
series |
Discrete Mathematics |
source_id |
49 |
title |
N-reconstructibility of non-reconstructible digraphs |
title_unstemmed |
N-reconstructibility of non-reconstructible digraphs |
title_full |
N-reconstructibility of non-reconstructible digraphs |
title_fullStr |
N-reconstructibility of non-reconstructible digraphs |
title_full_unstemmed |
N-reconstructibility of non-reconstructible digraphs |
title_short |
N-reconstructibility of non-reconstructible digraphs |
title_sort |
n-reconstructibility of non-reconstructible digraphs |
topic |
Discrete Mathematics and Combinatorics Theoretical Computer Science |
url |
http://dx.doi.org/10.1016/0012-365x(83)90122-x |
publishDate |
1983 |
physical |
279-294 |
description |
|
container_issue |
3 |
container_start_page |
279 |
container_title |
Discrete Mathematics |
container_volume |
46 |
format_de105 |
Article, E-Article |
format_de14 |
Article, E-Article |
format_de15 |
Article, E-Article |
format_de520 |
Article, E-Article |
format_de540 |
Article, E-Article |
format_dech1 |
Article, E-Article |
format_ded117 |
Article, E-Article |
format_degla1 |
E-Article |
format_del152 |
Buch |
format_del189 |
Article, E-Article |
format_dezi4 |
Article |
format_dezwi2 |
Article, E-Article |
format_finc |
Article, E-Article |
format_nrw |
Article, E-Article |
_version_ |
1792333129556426752 |
geogr_code |
not assigned |
last_indexed |
2024-03-01T14:07:51.747Z |
geogr_code_person |
not assigned |
openURL |
url_ver=Z39.88-2004&ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fvufind.svn.sourceforge.net%3Agenerator&rft.title=N-reconstructibility+of+non-reconstructible+digraphs&rft.date=1983-01-01&genre=article&issn=0012-365X&volume=46&issue=3&spage=279&epage=294&pages=279-294&jtitle=Discrete+Mathematics&atitle=N-reconstructibility+of+non-reconstructible+digraphs&aulast=Ramachandran&aufirst=S.&rft_id=info%3Adoi%2F10.1016%2F0012-365x%2883%2990122-x&rft.language%5B0%5D=eng |
SOLR | |
_version_ | 1792333129556426752 |
author | Ramachandran, S. |
author_facet | Ramachandran, S., Ramachandran, S. |
author_sort | ramachandran, s. |
container_issue | 3 |
container_start_page | 279 |
container_title | Discrete Mathematics |
container_volume | 46 |
description | |
doi_str_mv | 10.1016/0012-365x(83)90122-x |
facet_avail | Online, Free |
finc_class_facet | Mathematik, Informatik |
format | ElectronicArticle |
format_de105 | Article, E-Article |
format_de14 | Article, E-Article |
format_de15 | Article, E-Article |
format_de520 | Article, E-Article |
format_de540 | Article, E-Article |
format_dech1 | Article, E-Article |
format_ded117 | Article, E-Article |
format_degla1 | E-Article |
format_del152 | Buch |
format_del189 | Article, E-Article |
format_dezi4 | Article |
format_dezwi2 | Article, E-Article |
format_finc | Article, E-Article |
format_nrw | Article, E-Article |
geogr_code | not assigned |
geogr_code_person | not assigned |
id | ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTAxNi8wMDEyLTM2NXgoODMpOTAxMjIteA |
imprint | Elsevier BV, 1983 |
imprint_str_mv | Elsevier BV, 1983 |
institution | DE-Zi4, DE-Gla1, DE-15, DE-Pl11, DE-Rs1, DE-14, DE-105, DE-Ch1, DE-L229, DE-D275, DE-Bn3, DE-Brt1, DE-Zwi2, DE-D161 |
issn | 0012-365X |
issn_str_mv | 0012-365X |
language | English |
last_indexed | 2024-03-01T14:07:51.747Z |
match_str | ramachandran1983nreconstructibilityofnonreconstructibledigraphs |
mega_collection | Elsevier BV (CrossRef) |
physical | 279-294 |
publishDate | 1983 |
publishDateSort | 1983 |
publisher | Elsevier BV |
record_format | ai |
recordtype | ai |
series | Discrete Mathematics |
source_id | 49 |
spelling | Ramachandran, S. 0012-365X Elsevier BV Discrete Mathematics and Combinatorics Theoretical Computer Science http://dx.doi.org/10.1016/0012-365x(83)90122-x N-reconstructibility of non-reconstructible digraphs Discrete Mathematics |
spellingShingle | Ramachandran, S., Discrete Mathematics, N-reconstructibility of non-reconstructible digraphs, Discrete Mathematics and Combinatorics, Theoretical Computer Science |
title | N-reconstructibility of non-reconstructible digraphs |
title_full | N-reconstructibility of non-reconstructible digraphs |
title_fullStr | N-reconstructibility of non-reconstructible digraphs |
title_full_unstemmed | N-reconstructibility of non-reconstructible digraphs |
title_short | N-reconstructibility of non-reconstructible digraphs |
title_sort | n-reconstructibility of non-reconstructible digraphs |
title_unstemmed | N-reconstructibility of non-reconstructible digraphs |
topic | Discrete Mathematics and Combinatorics, Theoretical Computer Science |
url | http://dx.doi.org/10.1016/0012-365x(83)90122-x |