{"id":"https://openalex.org/W4281784752","doi":"https://doi.org/10.1142/s1793830922501142","title":"Nordhaus\u2013Gaddum problem in terms of G-free coloring","display_name":"Nordhaus\u2013Gaddum problem in terms of G-free coloring","publication_year":2022,"publication_date":"2022-06-04","ids":{"openalex":"https://openalex.org/W4281784752","doi":"https://doi.org/10.1142/s1793830922501142"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830922501142","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830922501142","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","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/A5079719299","display_name":"Yaser Rowshan","orcid":null},"institutions":[{"id":"https://openalex.org/I161028277","display_name":"Institute for Advanced Studies in Basic Sciences","ror":"https://ror.org/00bzsst90","country_code":"IR","type":"education","lineage":["https://openalex.org/I161028277"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Yaser Rowshan","raw_affiliation_strings":["Department of Mathematics, Institute for Advanced Studies in Basic Sciences (IASBS), Zanjan 45137-66731, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Institute for Advanced Studies in Basic Sciences (IASBS), Zanjan 45137-66731, Iran","institution_ids":["https://openalex.org/I161028277"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5079719299"],"corresponding_institution_ids":["https://openalex.org/I161028277"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16466855,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"15","issue":"04","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9986000061035156,"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"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9986000061035156,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9973000288009644,"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.9973000288009644,"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.7152239680290222},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.504388689994812},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43032923340797424},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3209030032157898}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7152239680290222},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.504388689994812},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43032923340797424},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3209030032157898}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830922501142","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830922501142","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W2078743813","https://openalex.org/W2085716675","https://openalex.org/W2143157065","https://openalex.org/W2319043422","https://openalex.org/W2332917832","https://openalex.org/W2495758475","https://openalex.org/W3006314047"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2911598644","https://openalex.org/W2042127053"],"abstract_inverted_index":{"Let":[0],"[Formula:":[1,8,12,18,27,34,41,45,48,52,58,71,78,82,88,95,103,106,112,117,129,134,137,145,153,162,176,206],"see":[2,9,13,19,28,35,42,46,49,53,59,72,79,83,89,96,104,107,113,118,130,135,138,146,154,163,177,207],"text]":[3,14,36,119,131,155],"be":[4,120],"a":[5,16,26,32,44,56,102,121,127,133,143,212],"graph.":[6,213],"A":[7],"text]-coloring":[10,50],"of":[11,37,51,70,77,87,123,161,181,185,188,211],"is":[15,55,91],"mapping":[17,57],"text],":[20,43,54,60,73,90,97,147],"if":[21,140],"each":[22,67,150],"color":[23,68,151],"class":[24,69,152],"induces":[25],"text]-free":[29,47,84,105,136,178,208],"subgraph.":[30],"For":[31],"graph":[33,128],"order":[38],"at":[39],"least":[40],"so":[61,98],"that":[62,99,116,149],"the":[63,92,175,186,201,205],"induced":[64],"subgraph":[65],"by":[66,111],"contains":[74],"no":[75],"copy":[76],"text].":[80,114,164],"The":[81],"chromatic":[85,179,195,209],"number":[86,94,180,187,210],"minimum":[93,192],"it":[100],"has":[101,132],"text]-coloring,":[108,139],"and":[109,172,194],"denoted":[110],"Suppose":[115],"family":[122],"graphs,":[124],"we":[125,168],"say":[126],"there":[141],"exists":[142],"map":[144],"such":[148],"does":[156],"not":[157],"contain":[158],"any":[159],"members":[160],"In":[165],"this":[166],"paper,":[167],"give":[169],"some":[170],"bounds":[171],"attributes":[173],"on":[174],"graphs":[182],"in":[183],"terms":[184],"vertices,":[189],"maximum":[190],"degree,":[191,193],"number.":[196],"Our":[197],"main":[198],"results":[199],"are":[200],"Nordhaus\u2013Gaddum-type":[202],"theorem":[203],"for":[204]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}