{"id":"https://openalex.org/W2035780934","doi":"https://doi.org/10.1007/bf01202468","title":"Independent trees in graphs","display_name":"Independent trees in graphs","publication_year":1994,"publication_date":"1994-03-01","ids":{"openalex":"https://openalex.org/W2035780934","doi":"https://doi.org/10.1007/bf01202468","mag":"2035780934"},"language":"en","primary_location":{"id":"doi:10.1007/bf01202468","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01202468","pdf_url":null,"source":{"id":"https://openalex.org/S186126824","display_name":"Graphs and Combinatorics","issn_l":"0911-0119","issn":["0911-0119","1435-5914"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Graphs and Combinatorics","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/A5040833061","display_name":"Andreas Huck","orcid":null},"institutions":[{"id":"https://openalex.org/I114112103","display_name":"Leibniz University Hannover","ror":"https://ror.org/0304hq317","country_code":"DE","type":"education","lineage":["https://openalex.org/I114112103"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Andreas Huck","raw_affiliation_strings":["Institut f\u00fcr Mathematik, Universit\u00e4t Hannover, Welfengarten 1, 30167, Hannover, Germany","Institut f\u00fcr Mathematik, Universit\u00e4t Hannover, Hannover, Germany 30167#TAB#"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Mathematik, Universit\u00e4t Hannover, Welfengarten 1, 30167, Hannover, Germany","institution_ids":["https://openalex.org/I114112103"]},{"raw_affiliation_string":"Institut f\u00fcr Mathematik, Universit\u00e4t Hannover, Hannover, Germany 30167#TAB#","institution_ids":["https://openalex.org/I114112103"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5040833061"],"corresponding_institution_ids":["https://openalex.org/I114112103"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.9309,"has_fulltext":false,"cited_by_count":70,"citation_normalized_percentile":{"value":0.74277366,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"10","issue":"1","first_page":"29","last_page":"45"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9976000189781189,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9976000189781189,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9865000247955322,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9575999975204468,"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.8729451894760132},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8092366456985474},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6277585029602051},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5296292901039124},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5261368751525879},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.43479570746421814},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.4327269494533539},{"id":"https://openalex.org/keywords/fork","display_name":"Fork (system call)","score":0.42758506536483765},{"id":"https://openalex.org/keywords/statement","display_name":"Statement (logic)","score":0.41231685876846313},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3775164783000946},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10138419270515442}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8729451894760132},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8092366456985474},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6277585029602051},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5296292901039124},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5261368751525879},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.43479570746421814},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.4327269494533539},{"id":"https://openalex.org/C40523978","wikidata":"https://www.wikidata.org/wiki/Q14675","display_name":"Fork (system call)","level":2,"score":0.42758506536483765},{"id":"https://openalex.org/C2777026412","wikidata":"https://www.wikidata.org/wiki/Q2684591","display_name":"Statement (logic)","level":2,"score":0.41231685876846313},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3775164783000946},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10138419270515442},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01202468","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01202468","pdf_url":null,"source":{"id":"https://openalex.org/S186126824","display_name":"Graphs and Combinatorics","issn_l":"0911-0119","issn":["0911-0119","1435-5914"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Graphs and Combinatorics","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":9,"referenced_works":["https://openalex.org/W1786780942","https://openalex.org/W1971061054","https://openalex.org/W1985686412","https://openalex.org/W1994556169","https://openalex.org/W2039846580","https://openalex.org/W2048958570","https://openalex.org/W2099497055","https://openalex.org/W2118382442","https://openalex.org/W2258857078"],"related_works":["https://openalex.org/W1987177025","https://openalex.org/W4301179398","https://openalex.org/W4389325756","https://openalex.org/W4286893801","https://openalex.org/W2066857130","https://openalex.org/W2382032469","https://openalex.org/W2487945693","https://openalex.org/W2095369952","https://openalex.org/W2053060257","https://openalex.org/W2149927264"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}