{"id":"https://openalex.org/W2034740402","doi":"https://doi.org/10.1080/00207160412331290685","title":"The complexity for partitioning graphs by monochromatic trees, cycles and paths","display_name":"The complexity for partitioning graphs by monochromatic trees, cycles and paths","publication_year":2004,"publication_date":"2004-11-01","ids":{"openalex":"https://openalex.org/W2034740402","doi":"https://doi.org/10.1080/00207160412331290685","mag":"2034740402"},"language":"en","primary_location":{"id":"doi:10.1080/00207160412331290685","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160412331290685","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","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/A5049379038","display_name":"Zemin Jin","orcid":"https://orcid.org/0000-0002-9034-6018"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zemin Jin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5100365966","display_name":"Xueliang Li","orcid":"https://orcid.org/0000-0002-8335-9873"},"institutions":[{"id":"https://openalex.org/I4210108542","display_name":"Schlumberger (Ireland)","ror":"https://ror.org/01mcc7007","country_code":"IE","type":"company","lineage":["https://openalex.org/I4210092184","https://openalex.org/I4210108542"]}],"countries":["IE"],"is_corresponding":true,"raw_author_name":"Xueliang Li","raw_affiliation_strings":["Correspondencex.li@eyou.com"],"affiliations":[{"raw_affiliation_string":"Correspondencex.li@eyou.com","institution_ids":["https://openalex.org/I4210108542"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100365966"],"corresponding_institution_ids":["https://openalex.org/I4210108542"],"apc_list":null,"apc_paid":null,"fwci":1.3828,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.80748922,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"81","issue":"11","first_page":"1357","last_page":"1362"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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.9995999932289124,"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/monochromatic-color","display_name":"Monochromatic color","score":0.833366870880127},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7902957201004028},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7547007203102112},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5837572813034058},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5091797709465027},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5026862621307373},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4534963071346283},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43621882796287537},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.41884803771972656},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.053387463092803955}],"concepts":[{"id":"https://openalex.org/C40833965","wikidata":"https://www.wikidata.org/wiki/Q6901438","display_name":"Monochromatic color","level":2,"score":0.833366870880127},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7902957201004028},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7547007203102112},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5837572813034058},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5091797709465027},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5026862621307373},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4534963071346283},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43621882796287537},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.41884803771972656},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.053387463092803955},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/00207160412331290685","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160412331290685","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.618.6144","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.618.6144","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.combinatorics.cn/publications/papers/2004/gcom041114.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W117318854","https://openalex.org/W1968948734","https://openalex.org/W1972978715","https://openalex.org/W1978665169","https://openalex.org/W1981338295","https://openalex.org/W1985834814","https://openalex.org/W1994460648","https://openalex.org/W2036185209","https://openalex.org/W2048177396","https://openalex.org/W2056735670","https://openalex.org/W2057452136","https://openalex.org/W2059936808","https://openalex.org/W2125690626","https://openalex.org/W2139317321","https://openalex.org/W2143996311","https://openalex.org/W2149498497","https://openalex.org/W2611804663"],"related_works":["https://openalex.org/W2036594069","https://openalex.org/W4244658307","https://openalex.org/W2156896570","https://openalex.org/W2949255922","https://openalex.org/W2038655901","https://openalex.org/W4241472005","https://openalex.org/W1627181101","https://openalex.org/W2043560626","https://openalex.org/W1558145674","https://openalex.org/W1566660502"],"abstract_inverted_index":{"Let":[0],"G":[1],"be":[2],"an":[3],"edge-coloured":[4],"graph.":[5,76],"We":[6,33],"show":[7,35],"in":[8],"this":[9],"paper":[10],"that":[11,36],"it":[12],"is":[13,38],"NP-hard":[14],"to":[15],"find":[16],"the":[17,27,30,45,56,60,72,75],"minimum":[18,61],"number":[19,62],"of":[20,29,58,63,74],"vertex":[21,64],"disjoint":[22,65],"monochromatic":[23,66],"trees":[24],"which":[25,70],"cover":[26,71],"vertices":[28,73],"graph":[31],"G.":[32],"also":[34],"there":[37],"no":[39],"constant":[40],"factor":[41],"approximation":[42],"algorithm":[43],"for":[44,55],"problem":[46,57],"unless":[47],"P":[48],"=":[49],"NP.":[50],"The":[51],"same":[52],"results":[53],"hold":[54],"finding":[59],"cycles":[67],"(paths,":[68],"respectively)":[69]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}