{"id":"https://openalex.org/W2069550285","doi":"https://doi.org/10.1002/jgt.3190140104","title":"New upper bounds for the greatest number of proper colorings of a (<i>V</i>,<i>E</i>)\u2010graph","display_name":"New upper bounds for the greatest number of proper colorings of a (<i>V</i>,<i>E</i>)\u2010graph","publication_year":1990,"publication_date":"1990-03-01","ids":{"openalex":"https://openalex.org/W2069550285","doi":"https://doi.org/10.1002/jgt.3190140104","mag":"2069550285"},"language":"en","primary_location":{"id":"doi:10.1002/jgt.3190140104","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190140104","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","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/A5031529103","display_name":"Felix Lazebnik","orcid":null},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Felix Lazebnik","raw_affiliation_strings":["Department of Mathematical Sciences, University of Delaware, Newark, Delaware"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, University of Delaware, Newark, Delaware","institution_ids":["https://openalex.org/I86501945"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5031529103"],"corresponding_institution_ids":["https://openalex.org/I86501945"],"apc_list":{"value":3760,"currency":"USD","value_usd":3760},"apc_paid":null,"fwci":0.9958,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.75923956,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"14","issue":"1","first_page":"25","last_page":"29"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9944000244140625,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9944000244140625,"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.9629999995231628,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9477999806404114,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.9102035164833069},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8557568788528442},{"id":"https://openalex.org/keywords/chromatic-polynomial","display_name":"Chromatic polynomial","score":0.5880754590034485},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5727120041847229},{"id":"https://openalex.org/keywords/chromatic-scale","display_name":"Chromatic scale","score":0.5257883071899414},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5233344435691833},{"id":"https://openalex.org/keywords/simple-graph","display_name":"Simple graph","score":0.5140513181686401},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4578479826450348}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.9102035164833069},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8557568788528442},{"id":"https://openalex.org/C126385604","wikidata":"https://www.wikidata.org/wiki/Q1087609","display_name":"Chromatic polynomial","level":3,"score":0.5880754590034485},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5727120041847229},{"id":"https://openalex.org/C196956537","wikidata":"https://www.wikidata.org/wiki/Q202021","display_name":"Chromatic scale","level":2,"score":0.5257883071899414},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5233344435691833},{"id":"https://openalex.org/C2993105083","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Simple graph","level":3,"score":0.5140513181686401},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4578479826450348}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/jgt.3190140104","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190140104","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","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":8,"referenced_works":["https://openalex.org/W71224568","https://openalex.org/W1510730180","https://openalex.org/W2018663595","https://openalex.org/W2034027701","https://openalex.org/W2043243657","https://openalex.org/W2092653160","https://openalex.org/W2319873605","https://openalex.org/W4246500452"],"related_works":["https://openalex.org/W2994358711","https://openalex.org/W2034116955","https://openalex.org/W2008080870","https://openalex.org/W4300844738","https://openalex.org/W2950815869","https://openalex.org/W2253595186","https://openalex.org/W2982067480","https://openalex.org/W4288088916","https://openalex.org/W2130504407","https://openalex.org/W2391615699"],"abstract_inverted_index":{"Abstract":[0],"Let":[1],"\ud835\udcbb":[2],"denote":[3,53],"the":[4,28,36,54],"family":[5],"of":[6,31,57],"simple":[7],"undirected":[8],"graphs":[9],"on":[10],"v":[11,17,39,48,77,104],"vertices":[12],"having":[13],"e":[14,19,41,50,69,79,106],"edges":[15],"((":[16],",":[18,40,42,49,51,78,80,105,107],")\u2010graphs)":[20],"and":[21,43],"P":[22,84],"(":[23,47,67,76,85,103],"G":[24,71,86,89],";":[25,87],"\u03bb)":[26,52,81],"be":[27],"chromatic":[29],"polynomial":[30],"a":[32,66],"graph":[33],"G.":[34],"For":[35],"given":[37],"integers":[38],"\u03bb,":[44],"let":[45],"f":[46,75,102],"greatest":[55],"number":[56],"proper":[58],"colorings":[59],"in":[60],"\u03bb":[61],"or":[62],"less":[63],"colors":[64],"that":[65],"v,":[68],")\u2010graph":[70],"can":[72],"have,":[73],"i.e.,":[74],"=":[82],"max{":[83],"\u03bb):":[88],"\u2208":[90],"\ud835\udcbb}.":[91],"In":[92],"this":[93],"paper":[94],"we":[95],"determine":[96],"some":[97],"new":[98],"upper":[99],"bounds":[100],"for":[101],"\u03bb).":[108]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}