{"id":"https://openalex.org/W3000608223","doi":"https://doi.org/10.37236/7970","title":"Decomposing Graphs into a Spanning Tree, an Even Graph, and a Star Forest","display_name":"Decomposing Graphs into a Spanning Tree, an Even Graph, and a Star Forest","publication_year":2019,"publication_date":"2019-03-08","ids":{"openalex":"https://openalex.org/W3000608223","doi":"https://doi.org/10.37236/7970","mag":"3000608223"},"language":"en","primary_location":{"id":"doi:10.37236/7970","is_oa":true,"landing_page_url":"https://doi.org/10.37236/7970","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v26i1p33/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v26i1p33/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039119940","display_name":"Kasper Szabo Lyngsie","orcid":"https://orcid.org/0000-0002-7277-6604"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Kasper Szabo Lyngsie","raw_affiliation_strings":["Technical University of Denmark"],"affiliations":[{"raw_affiliation_string":"Technical University of Denmark","institution_ids":["https://openalex.org/I96673099"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058756924","display_name":"Martin Merker","orcid":"https://orcid.org/0000-0003-4555-6021"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Martin Merker","raw_affiliation_strings":["Technical University of Denmark"],"affiliations":[{"raw_affiliation_string":"Technical University of Denmark","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5039119940"],"corresponding_institution_ids":["https://openalex.org/I96673099"],"apc_list":null,"apc_paid":null,"fwci":0.1998,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.58875226,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"26","issue":"1","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.9998999834060669,"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.9998999834060669,"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.9980999827384949,"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.9955999851226807,"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/spanning-tree","display_name":"Spanning tree","score":0.7775911092758179},{"id":"https://openalex.org/keywords/star","display_name":"Star (game theory)","score":0.5903973579406738},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5530878305435181},{"id":"https://openalex.org/keywords/tr\u00e9maux-tree","display_name":"Tr\u00e9maux tree","score":0.5041266679763794},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.48445749282836914},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45703211426734924},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4568844437599182},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.4414919316768646},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3985886573791504},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.35077401995658875},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32580268383026123},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.2520178556442261}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7775911092758179},{"id":"https://openalex.org/C2780897414","wikidata":"https://www.wikidata.org/wiki/Q7600592","display_name":"Star (game theory)","level":2,"score":0.5903973579406738},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5530878305435181},{"id":"https://openalex.org/C124302570","wikidata":"https://www.wikidata.org/wiki/Q7849146","display_name":"Tr\u00e9maux tree","level":5,"score":0.5041266679763794},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.48445749282836914},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45703211426734924},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4568844437599182},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4414919316768646},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3985886573791504},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.35077401995658875},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32580268383026123},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2520178556442261},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.37236/7970","is_oa":true,"landing_page_url":"https://doi.org/10.37236/7970","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v26i1p33/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/58681e8e-60a0-4eac-b5a2-949aa6b40f27","is_oa":true,"landing_page_url":"https://orbit.dtu.dk/en/publications/58681e8e-60a0-4eac-b5a2-949aa6b40f27","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Lyngsie , K S & Merker , M 2019 , ' Decomposing graphs into a spanning tree, an even graph, and a star forest ' , The Electronic Journal of Combinatorics , vol. 26 , no. 1 , P1.33 .","raw_type":"article"}],"best_oa_location":{"id":"doi:10.37236/7970","is_oa":true,"landing_page_url":"https://doi.org/10.37236/7970","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v26i1p33/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/15","score":0.41999998688697815,"display_name":"Life in Land"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3000608223.pdf","grobid_xml":"https://content.openalex.org/works/W3000608223.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W57803052","https://openalex.org/W2055026045","https://openalex.org/W2067078311","https://openalex.org/W2090278383","https://openalex.org/W2220922100","https://openalex.org/W2394610828","https://openalex.org/W2465245986","https://openalex.org/W2497758782","https://openalex.org/W2963241860","https://openalex.org/W6600538214","https://openalex.org/W6655318272","https://openalex.org/W6681462111","https://openalex.org/W6811152439","https://openalex.org/W6817201621"],"related_works":["https://openalex.org/W4231397933","https://openalex.org/W2374925474","https://openalex.org/W2041080724","https://openalex.org/W2911818503","https://openalex.org/W2779618893","https://openalex.org/W4380840098","https://openalex.org/W1541890612","https://openalex.org/W2138987445","https://openalex.org/W1738503018","https://openalex.org/W3195481350"],"abstract_inverted_index":{"We":[0],"prove":[1],"that":[2],"every":[3],"connected":[4],"graph":[5],"can":[6],"be":[7],"edge-decomposed":[8],"into":[9],"a":[10,17],"spanning":[11],"tree,":[12],"an":[13],"even":[14],"graph,":[15],"and":[16],"star":[18],"forest.":[19]},"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":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}