{"id":"https://openalex.org/W2006474823","doi":"https://doi.org/10.1007/s00373-012-1277-5","title":"Spanning Trees with a Bounded Number of Branch Vertices in a Claw-Free Graph","display_name":"Spanning Trees with a Bounded Number of Branch Vertices in a Claw-Free Graph","publication_year":2012,"publication_date":"2012-12-29","ids":{"openalex":"https://openalex.org/W2006474823","doi":"https://doi.org/10.1007/s00373-012-1277-5","mag":"2006474823"},"language":"en","primary_location":{"id":"doi:10.1007/s00373-012-1277-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00373-012-1277-5","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/A5001555030","display_name":"Haruhide Matsuda","orcid":"https://orcid.org/0000-0003-2022-619X"},"institutions":[{"id":"https://openalex.org/I171481255","display_name":"Shibaura Institute of Technology","ror":"https://ror.org/020wjcq07","country_code":"JP","type":"education","lineage":["https://openalex.org/I171481255"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Haruhide Matsuda","raw_affiliation_strings":["Department of Mathematics, Shibaura Institute of Technology, 307 Fukasaku, Minuma-ku, Saitama, 337-8570, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Shibaura Institute of Technology, 307 Fukasaku, Minuma-ku, Saitama, 337-8570, Japan","institution_ids":["https://openalex.org/I171481255"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080040800","display_name":"Kenta Ozeki","orcid":"https://orcid.org/0000-0003-3118-0086"},"institutions":[{"id":"https://openalex.org/I184597095","display_name":"National Institute of Informatics","ror":"https://ror.org/04ksd4g47","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1319490839","https://openalex.org/I184597095","https://openalex.org/I4210158934"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Kenta Ozeki","raw_affiliation_strings":["JST, ERATO, Kawarabayashi Large Graph Project, Tokyo, Japan","National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo, 101-8430, Japan"],"affiliations":[{"raw_affiliation_string":"JST, ERATO, Kawarabayashi Large Graph Project, Tokyo, Japan","institution_ids":[]},{"raw_affiliation_string":"National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo, 101-8430, Japan","institution_ids":["https://openalex.org/I184597095"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007934756","display_name":"Tomoki Yamashita","orcid":"https://orcid.org/0000-0003-2394-324X"},"institutions":[{"id":"https://openalex.org/I916559398","display_name":"Kindai University","ror":"https://ror.org/05kt9ap64","country_code":"JP","type":"education","lineage":["https://openalex.org/I916559398"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Tomoki Yamashita","raw_affiliation_strings":["Department of Mathematics, Kinki University, 3-4-1 Kowakae, Higashiosaka, Osaka, 577-8502, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Kinki University, 3-4-1 Kowakae, Higashiosaka, Osaka, 577-8502, Japan","institution_ids":["https://openalex.org/I916559398"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5080040800"],"corresponding_institution_ids":["https://openalex.org/I184597095"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.6959,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.70688757,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"30","issue":"2","first_page":"429","last_page":"437"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9940000176429749,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8812949657440186},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7981220483779907},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.6578628420829773},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6099410057067871},{"id":"https://openalex.org/keywords/tr\u00e9maux-tree","display_name":"Tr\u00e9maux tree","score":0.5612530708312988},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4932538866996765},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4559131860733032},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.42865097522735596},{"id":"https://openalex.org/keywords/wheel-graph","display_name":"Wheel graph","score":0.4149896204471588},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.35505786538124084},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3302440047264099},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.18549317121505737},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.1418733298778534}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8812949657440186},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7981220483779907},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.6578628420829773},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6099410057067871},{"id":"https://openalex.org/C124302570","wikidata":"https://www.wikidata.org/wiki/Q7849146","display_name":"Tr\u00e9maux tree","level":5,"score":0.5612530708312988},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4932538866996765},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4559131860733032},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.42865097522735596},{"id":"https://openalex.org/C148364342","wikidata":"https://www.wikidata.org/wiki/Q948887","display_name":"Wheel graph","level":5,"score":0.4149896204471588},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.35505786538124084},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3302440047264099},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.18549317121505737},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.1418733298778534},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00373-012-1277-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00373-012-1277-5","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":14,"referenced_works":["https://openalex.org/W161891198","https://openalex.org/W1588423454","https://openalex.org/W1986401512","https://openalex.org/W1996124717","https://openalex.org/W1999323173","https://openalex.org/W2017852713","https://openalex.org/W2026543816","https://openalex.org/W2031299486","https://openalex.org/W2044691815","https://openalex.org/W2057926554","https://openalex.org/W2058894268","https://openalex.org/W2084408260","https://openalex.org/W2404724826","https://openalex.org/W4239638204"],"related_works":["https://openalex.org/W2382032469","https://openalex.org/W1966931974","https://openalex.org/W4301179398","https://openalex.org/W4389914601","https://openalex.org/W4231397933","https://openalex.org/W2406749215","https://openalex.org/W2487945693","https://openalex.org/W4292517404","https://openalex.org/W2159421784","https://openalex.org/W2594655405"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}