{"id":"https://openalex.org/W2088305949","doi":"https://doi.org/10.1007/s00373-007-0766-4","title":"On Planar Graphs Arbitrarily Decomposable into Closed Trails","display_name":"On Planar Graphs Arbitrarily Decomposable into Closed Trails","publication_year":2008,"publication_date":"2008-02-01","ids":{"openalex":"https://openalex.org/W2088305949","doi":"https://doi.org/10.1007/s00373-007-0766-4","mag":"2088305949"},"language":"en","primary_location":{"id":"doi:10.1007/s00373-007-0766-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00373-007-0766-4","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/A5055656391","display_name":"Mirko Hor\u0148\u00e1k","orcid":"https://orcid.org/0000-0002-3588-8455"},"institutions":[{"id":"https://openalex.org/I4210105280","display_name":"Institute of Mathematics","ror":"https://ror.org/00vsg3p53","country_code":"BY","type":"facility","lineage":["https://openalex.org/I151823869","https://openalex.org/I4210105280","https://openalex.org/I4210116091"]}],"countries":["BY"],"is_corresponding":true,"raw_author_name":"Mirko Hor\u0148\u00e1k","raw_affiliation_strings":["Institute of Mathematics, P. J. \u0160af\u00e1rik University, Jesenn\u00e1 5, 040 01, Ko\u0161ice, Slovak Republic","P. J. \u0160af\u00e1rik University, Institute of Mathematics, Jesenn\u00e1 5, 040 01, Ko\u0161ice, Slovak Republic#TAB#"],"affiliations":[{"raw_affiliation_string":"Institute of Mathematics, P. J. \u0160af\u00e1rik University, Jesenn\u00e1 5, 040 01, Ko\u0161ice, Slovak Republic","institution_ids":["https://openalex.org/I4210105280"]},{"raw_affiliation_string":"P. J. \u0160af\u00e1rik University, Institute of Mathematics, Jesenn\u00e1 5, 040 01, Ko\u0161ice, Slovak Republic#TAB#","institution_ids":["https://openalex.org/I4210105280"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034447227","display_name":"Zuzana Kockov\u00e1","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zuzana Kockov\u00e1","raw_affiliation_strings":["Credium, a.s., Vladislavova 17, 110 00, Praha 1, Czech Republic","Credium, a.s., Vladislavova 17, 110 00, Praha 1, Czech Republic#TAB#"],"affiliations":[{"raw_affiliation_string":"Credium, a.s., Vladislavova 17, 110 00, Praha 1, Czech Republic","institution_ids":[]},{"raw_affiliation_string":"Credium, a.s., Vladislavova 17, 110 00, Praha 1, Czech Republic#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5055656391"],"corresponding_institution_ids":["https://openalex.org/I4210105280"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.12048919,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"24","issue":"1","first_page":"19","last_page":"28"},"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.9998999834060669,"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.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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.9957000017166138,"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.897459864616394},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8014087677001953},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6078002452850342},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5457479357719421},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5048049688339233},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.4569469094276428},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44689637422561646},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.43639686703681946},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4315411448478699}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.897459864616394},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8014087677001953},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6078002452850342},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5457479357719421},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5048049688339233},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.4569469094276428},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44689637422561646},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.43639686703681946},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4315411448478699},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00373-007-0766-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00373-007-0766-4","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":8,"referenced_works":["https://openalex.org/W95137567","https://openalex.org/W2018732791","https://openalex.org/W2021149991","https://openalex.org/W2043912076","https://openalex.org/W2068409559","https://openalex.org/W2086254763","https://openalex.org/W2086326383","https://openalex.org/W2113571905"],"related_works":["https://openalex.org/W4256429076","https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W2012063272","https://openalex.org/W2348092930","https://openalex.org/W2138685729","https://openalex.org/W2062850566","https://openalex.org/W4308716484","https://openalex.org/W2098284475","https://openalex.org/W2018173726"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}