{"id":"https://openalex.org/W2093027527","doi":"https://doi.org/10.1007/s00373-010-0991-0","title":"Factorizations of Complete Graphs into Trees with at most Four Non-Leave Vertices","display_name":"Factorizations of Complete Graphs into Trees with at most Four Non-Leave Vertices","publication_year":2010,"publication_date":"2010-11-02","ids":{"openalex":"https://openalex.org/W2093027527","doi":"https://doi.org/10.1007/s00373-010-0991-0","mag":"2093027527"},"language":"en","primary_location":{"id":"doi:10.1007/s00373-010-0991-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00373-010-0991-0","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/A5019723815","display_name":"Dalibor Fron\u010dek","orcid":"https://orcid.org/0000-0003-4528-2059"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]},{"id":"https://openalex.org/I4210115145","display_name":"University of Minnesota, Duluth","ror":"https://ror.org/01hy4qx27","country_code":"US","type":"education","lineage":["https://openalex.org/I4210115145"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dalibor Fron\u010dek","raw_affiliation_strings":["Department of Mathematics and Statistics, University of Minnesota Duluth, Duluth, MN, 55812-3000, USA","University of Minnesota Duluth, Department of Mathematics and Statistics, 55812-3000, Duluth, MN, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, University of Minnesota Duluth, Duluth, MN, 55812-3000, USA","institution_ids":["https://openalex.org/I4210115145"]},{"raw_affiliation_string":"University of Minnesota Duluth, Department of Mathematics and Statistics, 55812-3000, Duluth, MN, USA#TAB#","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091791372","display_name":"Petr Kov\u00e1\u0159","orcid":"https://orcid.org/0000-0002-7847-5060"},"institutions":[{"id":"https://openalex.org/I142208455","display_name":"VSB - Technical University of Ostrava","ror":"https://ror.org/05x8mcb75","country_code":"CZ","type":"education","lineage":["https://openalex.org/I142208455"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Petr Kov\u00e1\u0159","raw_affiliation_strings":["Department of Applied Mathematics, V\u0160B \u2013 Technical University of Ostrava, 17. listopadu, 708 33, Ostrava\u2013Poruba, Czech Republic","V\u0160B \u2013 Technical University of Ostrava, Department of Applied Mathematics, 17. listopadu, 708 33, Ostrava\u2013Poruba, Czech Republic#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, V\u0160B \u2013 Technical University of Ostrava, 17. listopadu, 708 33, Ostrava\u2013Poruba, Czech Republic","institution_ids":["https://openalex.org/I142208455"]},{"raw_affiliation_string":"V\u0160B \u2013 Technical University of Ostrava, Department of Applied Mathematics, 17. listopadu, 708 33, Ostrava\u2013Poruba, Czech Republic#TAB#","institution_ids":["https://openalex.org/I142208455"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085922582","display_name":"Michael Kubesa","orcid":null},"institutions":[{"id":"https://openalex.org/I142208455","display_name":"VSB - Technical University of Ostrava","ror":"https://ror.org/05x8mcb75","country_code":"CZ","type":"education","lineage":["https://openalex.org/I142208455"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Michael Kubesa","raw_affiliation_strings":["Department of Applied Mathematics, V\u0160B \u2013 Technical University of Ostrava, 17. listopadu, 708 33, Ostrava\u2013Poruba, Czech Republic","V\u0160B \u2013 Technical University of Ostrava, Department of Applied Mathematics, 17. listopadu, 708 33, Ostrava\u2013Poruba, Czech Republic#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, V\u0160B \u2013 Technical University of Ostrava, 17. listopadu, 708 33, Ostrava\u2013Poruba, Czech Republic","institution_ids":["https://openalex.org/I142208455"]},{"raw_affiliation_string":"V\u0160B \u2013 Technical University of Ostrava, Department of Applied Mathematics, 17. listopadu, 708 33, Ostrava\u2013Poruba, Czech Republic#TAB#","institution_ids":["https://openalex.org/I142208455"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5091791372"],"corresponding_institution_ids":["https://openalex.org/I142208455"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.2943,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.65138729,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"27","issue":"5","first_page":"621","last_page":"646"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9979000091552734,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9894000291824341,"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.823664128780365},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8185514211654663},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.5597056150436401},{"id":"https://openalex.org/keywords/wheel-graph","display_name":"Wheel graph","score":0.5074607729911804},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.46168580651283264},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4456864595413208},{"id":"https://openalex.org/keywords/complete-graph","display_name":"Complete graph","score":0.42981192469596863},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4066028594970703},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.2849239110946655},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.21598944067955017},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.05496618151664734}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.823664128780365},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8185514211654663},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.5597056150436401},{"id":"https://openalex.org/C148364342","wikidata":"https://www.wikidata.org/wiki/Q948887","display_name":"Wheel graph","level":5,"score":0.5074607729911804},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.46168580651283264},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4456864595413208},{"id":"https://openalex.org/C125080357","wikidata":"https://www.wikidata.org/wiki/Q45715","display_name":"Complete graph","level":3,"score":0.42981192469596863},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4066028594970703},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.2849239110946655},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.21598944067955017},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.05496618151664734}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00373-010-0991-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00373-010-0991-0","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":6,"referenced_works":["https://openalex.org/W97654441","https://openalex.org/W1967615557","https://openalex.org/W1986950197","https://openalex.org/W2019204428","https://openalex.org/W2112641412","https://openalex.org/W2278010753"],"related_works":["https://openalex.org/W2064737922","https://openalex.org/W2982283786","https://openalex.org/W2092677743","https://openalex.org/W2151291961","https://openalex.org/W4288436438","https://openalex.org/W2217899045","https://openalex.org/W1995383828","https://openalex.org/W4312122303","https://openalex.org/W2904727379","https://openalex.org/W2386084529"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-06-19T17:40:00.097472","created_date":"2025-10-10T00:00:00"}