{"id":"https://openalex.org/W2027082315","doi":"https://doi.org/10.1002/jgt.3190060109","title":"Note on the reconstruction of infinite graphs with a fixed finite number of components","display_name":"Note on the reconstruction of infinite graphs with a fixed finite number of components","publication_year":1982,"publication_date":"1982-03-01","ids":{"openalex":"https://openalex.org/W2027082315","doi":"https://doi.org/10.1002/jgt.3190060109","mag":"2027082315"},"language":"en","primary_location":{"id":"doi:10.1002/jgt.3190060109","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190060109","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5014304107","display_name":"Thomas Andreae","orcid":null},"institutions":[{"id":"https://openalex.org/I75951250","display_name":"Freie Universit\u00e4t Berlin","ror":"https://ror.org/046ak2485","country_code":"DE","type":"education","lineage":["https://openalex.org/I75951250"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Thomas Andreae","raw_affiliation_strings":["Freie Universitat Berlin, 1000 Berlin 33, West Germany","Freie Universit\u00e4t Berlin, 1000 Berlin 33, West Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Freie Universitat Berlin, 1000 Berlin 33, West Germany","institution_ids":["https://openalex.org/I75951250"]},{"raw_affiliation_string":"Freie Universit\u00e4t Berlin, 1000 Berlin 33, West Germany","institution_ids":["https://openalex.org/I75951250"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5014304107"],"corresponding_institution_ids":["https://openalex.org/I75951250"],"apc_list":{"value":3760,"currency":"USD","value_usd":3760},"apc_paid":null,"fwci":1.5396,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.77747253,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"6","issue":"1","first_page":"81","last_page":"83"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12923","display_name":"Digital Image Processing Techniques","score":0.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9884999990463257,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8662975430488586},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.849821150302887},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.8171887397766113},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.7109509706497192},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5729645490646362},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5226150155067444},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48432815074920654},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3019641637802124},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.049089521169662476}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8662975430488586},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.849821150302887},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.8171887397766113},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.7109509706497192},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5729645490646362},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5226150155067444},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48432815074920654},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3019641637802124},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.049089521169662476},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/jgt.3190060109","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190060109","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1970187907","https://openalex.org/W1991163837","https://openalex.org/W2041396751","https://openalex.org/W2075084424","https://openalex.org/W2093646058","https://openalex.org/W2735699853","https://openalex.org/W4210766026"],"related_works":["https://openalex.org/W4309222106","https://openalex.org/W2012590989","https://openalex.org/W4385681624","https://openalex.org/W4240581084","https://openalex.org/W1734188852","https://openalex.org/W2952569802","https://openalex.org/W2049141591","https://openalex.org/W2950489642","https://openalex.org/W4297939726","https://openalex.org/W4298858221"],"abstract_inverted_index":{"Abstract":[0],"For":[1],"every":[2],"positive":[3],"integer":[4],"c":[5,12,15,23,28,31,36,39],",":[6,13,60],"we":[7],"construct":[8],"a":[9,49,67],"pair":[10,57,68],"G":[11,27,35,58],"H":[14,30,38,61],"of":[16,44,51,69,83],"infinite,":[17],"nonisomorphic":[18],"graphs":[19,73],"both":[20],"having":[21,75],"exactly":[22],"components":[24],"such":[25],"that":[26],"and":[29,37,53],"are":[32],"hypomorphic,":[33,71],"i.e.,":[34],"have":[40],"the":[41,56,84,89],"same":[42],"families":[43],"vertex\u2010deleted":[45],"subgraphs.":[46],"This":[47],"solves":[48],"problem":[50],"Bondy":[52],"Hemminger.":[54],"Furthermore,":[55],"1":[59,62],"is":[63],"an":[64],"example":[65],"for":[66,92],"non\u2010isomorphic,":[70],"connected":[72,76],"also":[74],"complements\u2014a":[77],"property":[78],"not":[79],"shared":[80],"by":[81],"any":[82],"previously":[85],"known":[86],"counterexamples":[87],"to":[88],"reconstruction":[90],"conjecture":[91],"infinite":[93],"graphs.":[94]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}