{"id":"https://openalex.org/W4232108645","doi":"https://doi.org/10.1002/(sici)1097-0118(199612)23:4<421::aid-jgt11>3.0.co;2-f","title":"The spanning trees forced by the path and the star","display_name":"The spanning trees forced by the path and the star","publication_year":1996,"publication_date":"1996-12-01","ids":{"openalex":"https://openalex.org/W4232108645","doi":"https://doi.org/10.1002/(sici)1097-0118(199612)23:4<421::aid-jgt11>3.0.co;2-f"},"language":"en","primary_location":{"id":"doi:10.1002/(sici)1097-0118(199612)23:4<421::aid-jgt11>3.0.co;2-f","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0118(199612)23:4<421::aid-jgt11>3.0.co;2-f","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","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/A5024791927","display_name":"Michael F. Bridgland","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael F. Bridgland","raw_affiliation_strings":["Center for Computing Sciences, Bowie, MD"],"affiliations":[{"raw_affiliation_string":"Center for Computing Sciences, Bowie, MD","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008224159","display_name":"Robert E. Jamison","orcid":"https://orcid.org/0000-0001-6116-7662"},"institutions":[{"id":"https://openalex.org/I8078737","display_name":"Clemson University","ror":"https://ror.org/037s24f05","country_code":"US","type":"education","lineage":["https://openalex.org/I8078737"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Robert E. Jamison","raw_affiliation_strings":["Department of Mathematical Sciences, Clemson University, Clemson, SC"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Clemson University, Clemson, SC","institution_ids":["https://openalex.org/I8078737"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017588081","display_name":"Jennifer S. Zito","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jennifer S. Zito","raw_affiliation_strings":["Center for Computing Sciences, Bowie, MD"],"affiliations":[{"raw_affiliation_string":"Center for Computing Sciences, Bowie, MD","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5008224159","https://openalex.org/A5017588081","https://openalex.org/A5024791927"],"corresponding_institution_ids":["https://openalex.org/I66946132","https://openalex.org/I8078737"],"apc_list":{"value":3760,"currency":"USD","value_usd":3760},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.3963733,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"23","issue":"4","first_page":"421","last_page":"441"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9987000226974487,"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.9987000226974487,"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.9889000058174133,"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"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9797999858856201,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.89687579870224},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8220587372779846},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7762939929962158},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.6633327007293701},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6207545399665833},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.6062824130058289},{"id":"https://openalex.org/keywords/tr\u00e9maux-tree","display_name":"Tr\u00e9maux tree","score":0.5771490931510925},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.5500326752662659},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.5444453954696655},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.5333969593048096},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.51268470287323},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.485002726316452},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.471355140209198},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.4578486979007721},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.4344981014728546},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.42169439792633057},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4110397696495056},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39137619733810425},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.26762664318084717},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.19111764430999756},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12328377366065979},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10744217038154602},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.08485591411590576}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.89687579870224},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8220587372779846},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7762939929962158},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.6633327007293701},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6207545399665833},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.6062824130058289},{"id":"https://openalex.org/C124302570","wikidata":"https://www.wikidata.org/wiki/Q7849146","display_name":"Tr\u00e9maux tree","level":5,"score":0.5771490931510925},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.5500326752662659},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.5444453954696655},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.5333969593048096},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.51268470287323},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.485002726316452},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.471355140209198},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.4578486979007721},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.4344981014728546},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.42169439792633057},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4110397696495056},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39137619733810425},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.26762664318084717},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.19111764430999756},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12328377366065979},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10744217038154602},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.08485591411590576},{"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.1002/(sici)1097-0118(199612)23:4<421::aid-jgt11>3.0.co;2-f","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0118(199612)23:4<421::aid-jgt11>3.0.co;2-f","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4099999964237213,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1985149601","https://openalex.org/W4308416203","https://openalex.org/W1997570556","https://openalex.org/W2911818503","https://openalex.org/W2307044859","https://openalex.org/W1754127855","https://openalex.org/W2014991506","https://openalex.org/W1510935138","https://openalex.org/W2055505431","https://openalex.org/W2052473415"],"abstract_inverted_index":{"A":[0,32,47],"set":[1,36,50,55,97,118,168],"S":[2,19,51,78],"of":[3,5,44,62,74,104,133,136,149,155,193,197,214,228],"trees":[4,76,135,157],"order":[6,38,45,63,99,121,137,198,215],"n":[7,39,64,86,122,138,171,199,203],"forces":[8,41],"a":[9,21,29,53,60,108,129,153,175,188,194,207,211,225],"tree":[10,17,23,34,43,95,166,212,227],"T":[11,27,213,223],"if":[12,67,70],"every":[13,42,93,115],"graph":[14,61,195],"having":[15],"each":[16,83,120],"in":[18,77],"as":[20,28,79],"spanning":[22,30,33,80,94,165,226],"must":[24],"also":[25],"have":[26],"tree.":[31],"forcing":[35,49,96,117,167],"for":[37,56,98,119,169],"that":[40,110,158,177],"n.":[46,100],"spanning-tree":[48,116],"is":[52,65,183,187,219,224],"test":[54],"panarboreal":[57,66],"graphs,":[58],"since":[59],"and":[68,128,145,174,200,210],"only":[69],"it":[71],"has":[72],"all":[73],"the":[75,89,111,134,143,146,178,217],"trees.":[81],"For":[82],"positive":[84],"integer":[85],"\u2260":[87],"1,":[88],"star":[90],"belongs":[91,113],"to":[92,114,162,220],"The":[101],"main":[102],"results":[103,151],"this":[105],"paper":[106],"are":[107],"proof":[109,176],"path":[112,144],"\u2209":[123],"{1,":[124],"6,":[125],"7,":[126],"8}":[127],"computationally":[130],"tractable":[131],"characterization":[132],"\u2265":[139,172],"15":[140,173],"forced":[141],"by":[142],"star.":[147],"Corollaries":[148],"those":[150],"include":[152],"construction":[154],"many":[156],"do":[159],"not":[160],"belong":[161],"any":[163],"minimal":[164],"orders":[170],"following":[179],"related":[180],"decision":[181],"problem":[182,218],"NP-complete:":[184],"an":[185],"instance":[186],"pair":[189],"(G,":[190],"T)":[191],"consisting":[192],"G":[196],"maximum":[201],"degree":[202],"-":[204],"1":[205],"with":[206],"hamiltonian":[208],"path,":[209],"n;":[216],"determine":[221],"whether":[222],"G.":[229],"\u00a9":[230],"1996":[231],"John":[232],"Wiley":[233],"&":[234],"Sons,":[235],"Inc.":[236]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}