{"id":"https://openalex.org/W1583570361","doi":"https://doi.org/10.37236/160","title":"Chromatic Number for a Generalization of Cartesian Product Graphs","display_name":"Chromatic Number for a Generalization of Cartesian Product Graphs","publication_year":2009,"publication_date":"2009-06-19","ids":{"openalex":"https://openalex.org/W1583570361","doi":"https://doi.org/10.37236/160","mag":"1583570361"},"language":"en","primary_location":{"id":"doi:10.37236/160","is_oa":true,"landing_page_url":"https://doi.org/10.37236/160","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r71/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":true,"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":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r71/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027559065","display_name":"Daniel Kr\u00e1l\u034f\u030c","orcid":"https://orcid.org/0000-0001-8680-0890"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Daniel Kr\u00e1l'","raw_affiliation_strings":["Charles University in Prague"],"affiliations":[{"raw_affiliation_string":"Charles University in Prague","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017595199","display_name":"Douglas B. West","orcid":"https://orcid.org/0000-0001-8818-1667"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Douglas B. West","raw_affiliation_strings":["University of Illinois at Urbana Champaign"],"affiliations":[{"raw_affiliation_string":"University of Illinois at Urbana Champaign","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5027559065"],"corresponding_institution_ids":["https://openalex.org/I21250087"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.05759122,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"16","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991999864578247,"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.9991999864578247,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9969000220298767,"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.9186442494392395},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8167303800582886},{"id":"https://openalex.org/keywords/cartesian-product","display_name":"Cartesian product","score":0.6544460654258728},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5298599600791931},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49956178665161133},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4354201555252075},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3499363660812378}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.9186442494392395},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8167303800582886},{"id":"https://openalex.org/C65236422","wikidata":"https://www.wikidata.org/wiki/Q173740","display_name":"Cartesian product","level":2,"score":0.6544460654258728},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5298599600791931},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49956178665161133},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4354201555252075},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3499363660812378},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.37236/160","is_oa":true,"landing_page_url":"https://doi.org/10.37236/160","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r71/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":true,"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.141.4247","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.141.4247","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://kam.mff.cuni.cz/~kamserie/serie/clanky/2008/s866.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.142.9232","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.9232","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://iti.mff.cuni.cz/series/files/iti388.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.143.1447","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.143.1447","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://iti.mff.cuni.cz/series/files/iti388.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.158.1178","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.1178","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.uiuc.edu/~west/pubs/cartcol.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.214.4372","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.214.4372","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_16/PDF/v16i1r71.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.37236/160","is_oa":true,"landing_page_url":"https://doi.org/10.37236/160","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r71/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":true,"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":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1583570361.pdf","grobid_xml":"https://content.openalex.org/works/W1583570361.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W285471286","https://openalex.org/W1720538414","https://openalex.org/W1968496968","https://openalex.org/W1968677127","https://openalex.org/W2011731192","https://openalex.org/W2048800330","https://openalex.org/W2057399436","https://openalex.org/W2097503509","https://openalex.org/W2100158662","https://openalex.org/W2112505974","https://openalex.org/W2149906774","https://openalex.org/W2316759756","https://openalex.org/W2514202683","https://openalex.org/W3135932689"],"related_works":["https://openalex.org/W2805171307","https://openalex.org/W2273131728","https://openalex.org/W4366733366","https://openalex.org/W3137798114","https://openalex.org/W4378087371","https://openalex.org/W2364608040","https://openalex.org/W2998748068","https://openalex.org/W1983442375","https://openalex.org/W3190844188","https://openalex.org/W4387398410"],"abstract_inverted_index":{"Let":[0,65],"${\\cal":[1,12,30,58,63,73,95,113,132],"G}$":[2,13,31,59,74,96,114,133],"be":[3],"a":[4,15,19,27],"class":[5,53,99,117,136],"of":[6,23,34,40,49,54,100,118,137],"graphs.":[7,103],"A":[8],"$d$-fold":[9,55],"grid":[10,22],"over":[11,57],"is":[14,60,75,86,97,115,134],"graph":[16,28,71],"obtained":[17],"from":[18,29],"$d$-dimensional":[20],"rectangular":[21],"vertices":[24],"by":[25,62,89],"placing":[26],"on":[32],"each":[33,44,70],"the":[35,41,98,116,135],"lines":[36],"parallel":[37],"to":[38,47],"one":[39,123],"axes.":[42],"Thus":[43],"vertex":[45],"belongs":[46],"$d$":[48],"these":[50],"subgraphs.":[51],"The":[52],"grids":[56],"denoted":[61],"G}^d$.":[64],"$f({\\cal":[66,78,92,108,126],"G};d)=\\max_{G\\in{\\cal":[67],"G}^d}\\chi(G)$.":[68],"If":[69],"in":[72],"$k$-colorable,":[76],"then":[77],"G};d)\\le":[79],"k^d$.":[80],"We":[81,104],"show":[82,106],"that":[83,91,107],"this":[84],"bound":[85],"best":[87],"possible":[88],"proving":[90],"G};d)=k^d$":[93],"when":[94,112,131],"all":[101],"$k$-colorable":[102],"also":[105],"G};d)\\ge{\\left\\lfloor\\sqrt{{d\\over":[109],"6\\log":[110,129],"d}}\\right\\rfloor}$":[111],"graphs":[119,138],"with":[120,139],"at":[121],"most":[122],"edge,":[124],"and":[125],"G};d)\\ge":[127],"{\\left\\lfloor{d\\over":[128],"d}\\right\\rfloor}$":[130],"maximum":[140],"degree":[141],"$1$.":[142]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}