{"id":"https://openalex.org/W2011897018","doi":"https://doi.org/10.1002/jgt.3190010409","title":"A property of trees in terms of unique connected subgraphs","display_name":"A property of trees in terms of unique connected subgraphs","publication_year":1977,"publication_date":"1977-12-01","ids":{"openalex":"https://openalex.org/W2011897018","doi":"https://doi.org/10.1002/jgt.3190010409","mag":"2011897018"},"language":"en","primary_location":{"id":"doi:10.1002/jgt.3190010409","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190010409","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/A5111934510","display_name":"Stephen T. Hedetniemi","orcid":null},"institutions":[{"id":"https://openalex.org/I51556381","display_name":"University of Virginia","ror":"https://ror.org/0153tk833","country_code":"US","type":"education","lineage":["https://openalex.org/I51556381"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Stephen T. Hedetniemi","raw_affiliation_strings":["University of Virginia, Charlottesville","University of Virginia, Charlottesville,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Virginia, Charlottesville","institution_ids":["https://openalex.org/I51556381"]},{"raw_affiliation_string":"University of Virginia, Charlottesville,","institution_ids":["https://openalex.org/I51556381"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062050678","display_name":"Diane M. Spresser","orcid":null},"institutions":[{"id":"https://openalex.org/I177405213","display_name":"Madison Area Technical College","ror":"https://ror.org/002y1bq07","country_code":"US","type":"education","lineage":["https://openalex.org/I177405213"]},{"id":"https://openalex.org/I51556381","display_name":"University of Virginia","ror":"https://ror.org/0153tk833","country_code":"US","type":"education","lineage":["https://openalex.org/I51556381"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Diane M. Spresser","raw_affiliation_strings":["Madison College, Harrisonburg, University of Virginia, Charlottesville"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Madison College, Harrisonburg, University of Virginia, Charlottesville","institution_ids":["https://openalex.org/I177405213","https://openalex.org/I51556381"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3760,"currency":"USD","value_usd":3760},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.23611111,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":"4","first_page":"335","last_page":"337"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.992900013923645,"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"}},{"id":"https://openalex.org/T12923","display_name":"Digital Image Processing Techniques","score":0.9570000171661377,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8677120208740234},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8282066583633423},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.547614574432373},{"id":"https://openalex.org/keywords/distance-hereditary-graph","display_name":"Distance-hereditary graph","score":0.49181845784187317},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.48256105184555054},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.4458775222301483},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.4456091821193695},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4289973974227905},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39948832988739014},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.16204264760017395},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.14535808563232422},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.06708955764770508}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8677120208740234},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8282066583633423},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.547614574432373},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.49181845784187317},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.48256105184555054},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.4458775222301483},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.4456091821193695},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4289973974227905},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39948832988739014},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.16204264760017395},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.14535808563232422},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.06708955764770508},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/jgt.3190010409","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190010409","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":1,"referenced_works":["https://openalex.org/W4213214460"],"related_works":["https://openalex.org/W2014594560","https://openalex.org/W1972252428","https://openalex.org/W1984251932","https://openalex.org/W2081611194","https://openalex.org/W2895519847","https://openalex.org/W2055609324","https://openalex.org/W3096856257","https://openalex.org/W2097210284","https://openalex.org/W2149120814","https://openalex.org/W3206911711"],"abstract_inverted_index":{"Abstract":[0],"The":[1],"following":[2],"theorem":[3],"is":[4,46],"proved:":[5],"Let":[6],"G":[7,39,45],"be":[8],"a":[9,33,47],"graph":[10],"with":[11],"p":[12,26],"\u2265":[13],"3":[14,22],"points":[15,30],"such":[16],"that":[17],"for":[18],"some":[19],"n":[20,24,29,42],",":[21,27],"\u2264":[23,25],"any":[28],"lie":[31],"on":[32],"unique":[34],"smallest":[35],"connected":[36],"subgraph.":[37],"Then":[38],"=":[40],"C":[41],"+1":[43],"or":[44],"tree,":[48],"and":[49],"conversely.":[50]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}