{"id":"https://openalex.org/W4413701156","doi":"https://doi.org/10.1007/s00373-025-02945-2","title":"Spanning Trees with Few Branch Vertices in a Chair-Free Graph","display_name":"Spanning Trees with Few Branch Vertices in a Chair-Free Graph","publication_year":2025,"publication_date":"2025-08-26","ids":{"openalex":"https://openalex.org/W4413701156","doi":"https://doi.org/10.1007/s00373-025-02945-2"},"language":"en","primary_location":{"id":"doi:10.1007/s00373-025-02945-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00373-025-02945-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00373-025-02945-2.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00373-025-02945-2.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Janee Schrader","orcid":null},"institutions":[{"id":"https://openalex.org/I124727415","display_name":"University of Wisconsin\u2013Eau Claire","ror":"https://ror.org/03mnm0t94","country_code":"US","type":"education","lineage":["https://openalex.org/I124727415"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Janee Schrader","raw_affiliation_strings":["University of Wisconsin Eau Claire, 105 Garfield Avenue, P.O. Box 4004, Eau Claire, WI, 54702-4004, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Wisconsin Eau Claire, 105 Garfield Avenue, P.O. Box 4004, Eau Claire, WI, 54702-4004, USA","institution_ids":["https://openalex.org/I124727415"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072558342","display_name":"Warren Shull","orcid":null},"institutions":[{"id":"https://openalex.org/I124727415","display_name":"University of Wisconsin\u2013Eau Claire","ror":"https://ror.org/03mnm0t94","country_code":"US","type":"education","lineage":["https://openalex.org/I124727415"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Warren Shull","raw_affiliation_strings":["University of Wisconsin Eau Claire, 105 Garfield Avenue, P.O. Box 4004, Eau Claire, WI, 54702-4004, USA"],"raw_orcid":"https://orcid.org/0009-0003-7952-4607","affiliations":[{"raw_affiliation_string":"University of Wisconsin Eau Claire, 105 Garfield Avenue, P.O. Box 4004, Eau Claire, WI, 54702-4004, USA","institution_ids":["https://openalex.org/I124727415"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I124727415"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.22773741,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"41","issue":"5","first_page":null,"last_page":null},"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9991999864578247,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9970999956130981,"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.8257506489753723},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7698119878768921},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5915898084640503},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.5719097256660461},{"id":"https://openalex.org/keywords/tr\u00e9maux-tree","display_name":"Tr\u00e9maux tree","score":0.49686506390571594},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4511869549751282},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3996986150741577},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.23408472537994385},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.09836062788963318}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8257506489753723},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7698119878768921},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5915898084640503},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.5719097256660461},{"id":"https://openalex.org/C124302570","wikidata":"https://www.wikidata.org/wiki/Q7849146","display_name":"Tr\u00e9maux tree","level":5,"score":0.49686506390571594},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4511869549751282},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3996986150741577},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.23408472537994385},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.09836062788963318}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00373-025-02945-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00373-025-02945-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00373-025-02945-2.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Graphs and Combinatorics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00373-025-02945-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00373-025-02945-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00373-025-02945-2.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Graphs and Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320311950","display_name":"University of Wisconsin-Eau Claire","ror":"https://ror.org/03mnm0t94"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4413701156.pdf","grobid_xml":"https://content.openalex.org/works/W4413701156.grobid-xml"},"referenced_works_count":9,"referenced_works":["https://openalex.org/W1966931974","https://openalex.org/W1996124717","https://openalex.org/W2006474823","https://openalex.org/W2026543816","https://openalex.org/W2031299486","https://openalex.org/W2044691815","https://openalex.org/W2907577633","https://openalex.org/W2979533220","https://openalex.org/W4363675666"],"related_works":["https://openalex.org/W2382032469","https://openalex.org/W4301179398","https://openalex.org/W4389914601","https://openalex.org/W4231397933","https://openalex.org/W2406749215","https://openalex.org/W1966931974","https://openalex.org/W2487945693","https://openalex.org/W2159421784","https://openalex.org/W4292517404","https://openalex.org/W2052473415"],"abstract_inverted_index":{"If":[0],"one":[1,130],"edge":[2],"of":[3,57,92,108],"a":[4,13,44,50,54,61,66,88,96,124],"claw":[5],"is":[6,11,79,113],"subdivided,":[7],"the":[8,105,121],"resulting":[9],"graph":[10,47,64,91,122],"called":[12],"chair.":[14],"Spanning":[15],"trees":[16,34],"in":[17,35],"claw-free":[18,137],"graphs":[19,140],"have":[20,49],"been":[21],"widely":[22],"studied,":[23],"but":[24],"we":[25],"are":[26,141,147],"unable":[27],"to":[28,48],"find":[29],"prior":[30],"results":[31],"on":[32],"spanning":[33,51,67,97,125],"chair-free":[36,46,63,90,139],"graphs.":[37],"We":[38],"show":[39],"two":[40],"sufficient":[41],"conditions":[42],"for":[43],"connected":[45,62,89],"tree":[52,68,98,126],"with":[53,69,99,127],"bounded":[55],"number":[56,78],"branch":[58,73,131],"vertices.":[59],"First,":[60],"has":[65,95,123],"at":[70,80,100,114,128],"most":[71,81,101,129],"k":[72],"vertices":[74,112],"if":[75,87],"its":[76],"independence":[77],"$$":[82,84,116,118],"2k+2":[83],".":[85],"Second,":[86],"order":[93],"n":[94],"4":[102],"leaves":[103],"and":[104,134,138,143],"degree":[106],"sum":[107],"any":[109],"five":[110],"independent":[111],"least":[115],"n-2":[117],",":[119],"then":[120],"vertex.":[132],"Similarities":[133],"differences":[135],"between":[136],"discussed,":[142],"several":[144],"related":[145],"conjectures":[146],"proposed.":[148]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}