{"id":"https://openalex.org/W236112762","doi":"https://doi.org/10.1007/pl00021190","title":"Independent Trees in Planar Graphs Independent trees","display_name":"Independent Trees in Planar Graphs Independent trees","publication_year":1999,"publication_date":"1999-03-01","ids":{"openalex":"https://openalex.org/W236112762","doi":"https://doi.org/10.1007/pl00021190","mag":"236112762"},"language":"en","primary_location":{"id":"doi:10.1007/pl00021190","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00021190","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":["Institute of Mathematics, University of Hannover, Welfengarten 1, 30167 Hannover, Germany. e-mail: huck@math.uni-hannover.de, , , , , , DE","Institute of Mathematics, University of Hannover, Welfengarten 1, 30167 Hannover, Germany. e-mail: huck@math.uni-hannover.de, DE"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Mathematics, University of Hannover, Welfengarten 1, 30167 Hannover, Germany. e-mail: huck@math.uni-hannover.de, , , , , , DE","institution_ids":["https://openalex.org/I114112103"]},{"raw_affiliation_string":"Institute of Mathematics, University of Hannover, Welfengarten 1, 30167 Hannover, Germany. e-mail: huck@math.uni-hannover.de, DE","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.9771,"has_fulltext":false,"cited_by_count":53,"citation_normalized_percentile":{"value":0.72473956,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"15","issue":"1","first_page":"29","last_page":"77"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9980000257492065,"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.9980000257492065,"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.9840999841690063,"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/T11152","display_name":"Stochastic processes and statistical mechanics","score":0.9455999732017517,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8935892581939697},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8201048970222473},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6067854166030884},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5202468633651733},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5037717223167419},{"id":"https://openalex.org/keywords/tr\u00e9maux-tree","display_name":"Tr\u00e9maux tree","score":0.4839785099029541},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4719889461994171},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47015050053596497},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.4659489393234253},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45799925923347473},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.4359643757343292},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.1283925473690033},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.12003061175346375}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8935892581939697},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8201048970222473},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6067854166030884},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5202468633651733},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5037717223167419},{"id":"https://openalex.org/C124302570","wikidata":"https://www.wikidata.org/wiki/Q7849146","display_name":"Tr\u00e9maux tree","level":5,"score":0.4839785099029541},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4719889461994171},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47015050053596497},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.4659489393234253},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45799925923347473},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.4359643757343292},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.1283925473690033},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.12003061175346375},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/pl00021190","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00021190","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1971061054","https://openalex.org/W1985686412","https://openalex.org/W2010188140","https://openalex.org/W2035780934","https://openalex.org/W2039846580","https://openalex.org/W2079000395","https://openalex.org/W2099497055"],"related_works":["https://openalex.org/W2073647226","https://openalex.org/W2159421784","https://openalex.org/W2594655405","https://openalex.org/W4231397933","https://openalex.org/W4292517404","https://openalex.org/W4361269909","https://openalex.org/W2374925474","https://openalex.org/W2609115092","https://openalex.org/W130518292","https://openalex.org/W2367979467"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"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":4},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-26T08:31:28.666265","created_date":"2025-10-10T00:00:00"}