{"id":"https://openalex.org/W2804426631","doi":"https://doi.org/10.1007/s00373-018-1906-8","title":"A note on a spanning $$(\\alpha ,\\beta )$$ ( \u03b1 , \u03b2 ) -ended tree in a bipartite graph","display_name":"A note on a spanning $$(\\alpha ,\\beta )$$ ( \u03b1 , \u03b2 ) -ended tree in a bipartite graph","publication_year":2018,"publication_date":"2018-05-22","ids":{"openalex":"https://openalex.org/W2804426631","doi":"https://doi.org/10.1007/s00373-018-1906-8","mag":"2804426631"},"language":"en","primary_location":{"id":"doi:10.1007/s00373-018-1906-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00373-018-1906-8","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/A5087489328","display_name":"Masao Tsugaki","orcid":"https://orcid.org/0000-0003-4757-7141"},"institutions":[{"id":"https://openalex.org/I161296585","display_name":"Tokyo University of Science","ror":"https://ror.org/05sj3n476","country_code":"JP","type":"education","lineage":["https://openalex.org/I161296585"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Masao Tsugaki","raw_affiliation_strings":["Tokyo University of Science, 1-3 Kagurazaka, Shinjuku-ku, Tokyo, 162-8601, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tokyo University of Science, 1-3 Kagurazaka, Shinjuku-ku, Tokyo, 162-8601, Japan","institution_ids":["https://openalex.org/I161296585"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5087489328"],"corresponding_institution_ids":["https://openalex.org/I161296585"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14433825,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"34","issue":"4","first_page":"693","last_page":"701"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"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/T11476","display_name":"Graph theory and applications","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9986000061035156,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9941999912261963,"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.8818277716636658},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.827114462852478},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7885248064994812},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7217251658439636},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.6189295649528503},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5046869516372681},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.5024919509887695},{"id":"https://openalex.org/keywords/edge-transitive-graph","display_name":"Edge-transitive graph","score":0.5002598762512207},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4491370916366577},{"id":"https://openalex.org/keywords/beta","display_name":"BETA (programming language)","score":0.41157734394073486},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2809162437915802},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.2180010974407196},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.05538696050643921}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8818277716636658},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.827114462852478},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7885248064994812},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7217251658439636},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.6189295649528503},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5046869516372681},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.5024919509887695},{"id":"https://openalex.org/C200597783","wikidata":"https://www.wikidata.org/wiki/Q4391289","display_name":"Edge-transitive graph","level":5,"score":0.5002598762512207},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4491370916366577},{"id":"https://openalex.org/C2776174256","wikidata":"https://www.wikidata.org/wiki/Q830842","display_name":"BETA (programming language)","level":2,"score":0.41157734394073486},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2809162437915802},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.2180010974407196},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.05538696050643921},{"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.1007/s00373-018-1906-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00373-018-1906-8","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":5,"referenced_works":["https://openalex.org/W1980905758","https://openalex.org/W1986401512","https://openalex.org/W2512607386","https://openalex.org/W4239638204","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2107875203","https://openalex.org/W2022808896","https://openalex.org/W1988790461","https://openalex.org/W3143578817","https://openalex.org/W2969335708","https://openalex.org/W2103879540","https://openalex.org/W2910933086","https://openalex.org/W3098480989","https://openalex.org/W2352066879","https://openalex.org/W3206955298"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}