{"id":"https://openalex.org/W2998904250","doi":"https://doi.org/10.37236/1741","title":"A Note on Graph Coloring Extensions and List-Colorings","display_name":"A Note on Graph Coloring Extensions and List-Colorings","publication_year":2003,"publication_date":"2003-03-23","ids":{"openalex":"https://openalex.org/W2998904250","doi":"https://doi.org/10.37236/1741","mag":"2998904250"},"language":"en","primary_location":{"id":"doi:10.37236/1741","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1741","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v10i1n1/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v10i1n1/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079004436","display_name":"Maria Axenovich","orcid":"https://orcid.org/0000-0002-8843-9557"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Maria Axenovich","raw_affiliation_strings":["Department of Mathematics Iowa State University, Ames, IA 50011, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics Iowa State University, Ames, IA 50011, USA","institution_ids":["https://openalex.org/I173911158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5079004436"],"corresponding_institution_ids":["https://openalex.org/I173911158"],"apc_list":null,"apc_paid":null,"fwci":4.401,"has_fulltext":true,"cited_by_count":37,"citation_normalized_percentile":{"value":0.95429432,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"10","issue":"1","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.9991000294685364,"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.9991000294685364,"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.9921000003814697,"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.989799976348877,"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.9087216854095459},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8328019380569458},{"id":"https://openalex.org/keywords/fractional-coloring","display_name":"Fractional coloring","score":0.650586724281311},{"id":"https://openalex.org/keywords/list-coloring","display_name":"List coloring","score":0.5485984086990356},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5442474484443665},{"id":"https://openalex.org/keywords/complete-coloring","display_name":"Complete coloring","score":0.5172241926193237},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"Greedy coloring","score":0.4961181581020355},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4835329055786133},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3754960298538208},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.1982058584690094},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.0662577748298645}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.9087216854095459},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8328019380569458},{"id":"https://openalex.org/C158319403","wikidata":"https://www.wikidata.org/wiki/Q5477527","display_name":"Fractional coloring","level":5,"score":0.650586724281311},{"id":"https://openalex.org/C199594403","wikidata":"https://www.wikidata.org/wiki/Q1130404","display_name":"List coloring","level":5,"score":0.5485984086990356},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5442474484443665},{"id":"https://openalex.org/C21642379","wikidata":"https://www.wikidata.org/wiki/Q3342988","display_name":"Complete coloring","level":5,"score":0.5172241926193237},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.4961181581020355},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4835329055786133},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3754960298538208},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.1982058584690094},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0662577748298645}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.37236/1741","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1741","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v10i1n1/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.2.8096","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.8096","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.combinatorics.org/Volume_10/PDF/v10i1n1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.9.3999","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.3999","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.combinatorics.org/Volume_10/PostScriptfiles/v10i1n1.ps","raw_type":"text"}],"best_oa_location":{"id":"doi:10.37236/1741","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1741","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v10i1n1/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334801","display_name":"Russian Academy of Sciences","ror":"https://ror.org/05qrfxd25"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2998904250.pdf","grobid_xml":"https://content.openalex.org/works/W2998904250.grobid-xml"},"referenced_works_count":4,"referenced_works":["https://openalex.org/W1985316243","https://openalex.org/W2085716675","https://openalex.org/W2167282783","https://openalex.org/W6602705845"],"related_works":["https://openalex.org/W2171203708","https://openalex.org/W4287598225","https://openalex.org/W3101541854","https://openalex.org/W3006791531","https://openalex.org/W4288422293","https://openalex.org/W1982933944","https://openalex.org/W4288274833","https://openalex.org/W4385892758","https://openalex.org/W2148122311","https://openalex.org/W2018072810"],"abstract_inverted_index":{"Let":[0,33],"$G$":[1,100,124],"be":[2,19,37,85,117],"a":[3,20,39,75,120],"graph":[4],"with":[5,24],"maximum":[6],"degree":[7],"$\\Delta":[8],"\\geq":[9],"3$":[10],"not":[11],"equal":[12],"to":[13,61,119],"$K_{\\Delta":[14],"+1}$":[15],"and":[16,50,71,101],"let":[17],"$P$":[18,102,111],"subset":[21],"of":[22,41,43,89,96,110,123],"vertices":[23,67],"pairwise":[25],"distance,":[26],"$d(P)$,":[27],"between":[28],"them":[29],"at":[30,113,126],"least":[31],"$8$.":[32],"each":[34,72],"vertex":[35,73],"$x$":[36],"assigned":[38],"list":[40],"colors":[42,70,116],"size":[44],"$\\Delta$":[45,115,128],"if":[46,52],"$x\\in":[47,53],"V\\setminus":[48],"P$":[49],"$1$":[51],"P$.":[54],"We":[55,80],"prove":[56],"that":[57,65,82],"it":[58],"is":[59],"possible":[60],"color":[62,76],"$V(G)$":[63],"such":[64],"adjacent":[66],"receive":[68],"different":[69],"has":[74],"from":[77],"its":[78],"list.":[79],"show":[81],"$d(P)$":[83],"cannot":[84],"improved.":[86],"This":[87],"generalization":[88],"Brooks'":[90],"theorem":[91],"answers":[92],"the":[93],"following":[94],"question":[95],"Albertson":[97],"positively:":[98],"If":[99],"are":[103],"objects":[104],"described":[105],"above,":[106],"can":[107],"any":[108],"coloring":[109,122],"in":[112,125],"most":[114,127],"extended":[118],"proper":[121],"colors?":[129]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}