{"id":"https://openalex.org/W1831506627","doi":"https://doi.org/10.37236/163","title":"Certificates of Factorisation for Chromatic Polynomials","display_name":"Certificates of Factorisation for Chromatic Polynomials","publication_year":2009,"publication_date":"2009-06-19","ids":{"openalex":"https://openalex.org/W1831506627","doi":"https://doi.org/10.37236/163","mag":"1831506627"},"language":"en","primary_location":{"id":"doi:10.37236/163","is_oa":true,"landing_page_url":"https://doi.org/10.37236/163","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r74/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/v16i1r74/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025441020","display_name":"Kerri Morgan","orcid":"https://orcid.org/0000-0002-7263-8340"},"institutions":[{"id":"https://openalex.org/I2801239119","display_name":"Australian Regenerative Medicine Institute","ror":"https://ror.org/02qa5kg76","country_code":"AU","type":"facility","lineage":["https://openalex.org/I2801037857","https://openalex.org/I2801239119","https://openalex.org/I56590836"]},{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Kerri Morgan","raw_affiliation_strings":["Clayton School of Information Technology Monash University Victoria, 3800 Australia","Monash university"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Clayton School of Information Technology Monash University Victoria, 3800 Australia","institution_ids":["https://openalex.org/I56590836"]},{"raw_affiliation_string":"Monash university","institution_ids":["https://openalex.org/I2801239119"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005637509","display_name":"Graham Farr","orcid":null},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Graham Farr","raw_affiliation_strings":["Clayton School of Information Technology Monash University Victoria, 3800 Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Clayton School of Information Technology Monash University Victoria, 3800 Australia","institution_ids":["https://openalex.org/I56590836"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3887,"has_fulltext":true,"cited_by_count":11,"citation_normalized_percentile":{"value":0.79809366,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9955000281333923,"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.9955000281333923,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9941999912261963,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.9937000274658203,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/chromatic-polynomial","display_name":"Chromatic polynomial","score":0.9278216361999512},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.811687707901001},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7999234199523926},{"id":"https://openalex.org/keywords/friendship-graph","display_name":"Friendship graph","score":0.6371256113052368},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.5179558992385864},{"id":"https://openalex.org/keywords/chromatic-scale","display_name":"Chromatic scale","score":0.49736288189888},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48437580466270447},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44047868251800537},{"id":"https://openalex.org/keywords/foster-graph","display_name":"Foster graph","score":0.41304126381874084},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11092889308929443},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.10641422867774963},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.07660260796546936}],"concepts":[{"id":"https://openalex.org/C126385604","wikidata":"https://www.wikidata.org/wiki/Q1087609","display_name":"Chromatic polynomial","level":3,"score":0.9278216361999512},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.811687707901001},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7999234199523926},{"id":"https://openalex.org/C70488441","wikidata":"https://www.wikidata.org/wiki/Q5504427","display_name":"Friendship graph","level":5,"score":0.6371256113052368},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.5179558992385864},{"id":"https://openalex.org/C196956537","wikidata":"https://www.wikidata.org/wiki/Q202021","display_name":"Chromatic scale","level":2,"score":0.49736288189888},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48437580466270447},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44047868251800537},{"id":"https://openalex.org/C68996132","wikidata":"https://www.wikidata.org/wiki/Q3115485","display_name":"Foster graph","level":5,"score":0.41304126381874084},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11092889308929443},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.10641422867774963},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.07660260796546936}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.37236/163","is_oa":true,"landing_page_url":"https://doi.org/10.37236/163","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r74/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.214.3962","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.214.3962","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/v16i1r74.pdf","raw_type":"text"},{"id":"pmh:oai:dro.deakin.edu.au:DU:30107618","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306401102","display_name":"Own your potential (DEAKIN)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149704539","host_organization_name":"Deakin University","host_organization_lineage":["https://openalex.org/I149704539"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},{"id":"pmh:oai:figshare.com:article/20812039","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/Certificates_of_factorisation_for_chromatic_polynomials/20812039","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"}],"best_oa_location":{"id":"doi:10.37236/163","is_oa":true,"landing_page_url":"https://doi.org/10.37236/163","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r74/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/W1831506627.pdf","grobid_xml":"https://content.openalex.org/works/W1831506627.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W1531965102","https://openalex.org/W1536180355","https://openalex.org/W1566906125","https://openalex.org/W1754421315","https://openalex.org/W1968430479","https://openalex.org/W1975442866","https://openalex.org/W1991410678","https://openalex.org/W2008263650","https://openalex.org/W2072572225","https://openalex.org/W2077457551","https://openalex.org/W2092041285","https://openalex.org/W2130504407","https://openalex.org/W2143683474","https://openalex.org/W2145020318","https://openalex.org/W2319873605","https://openalex.org/W2401610261","https://openalex.org/W3101156059","https://openalex.org/W4240324820","https://openalex.org/W4300185974","https://openalex.org/W6669971871"],"related_works":["https://openalex.org/W4248987388","https://openalex.org/W2332295289","https://openalex.org/W2092041285","https://openalex.org/W2049992750","https://openalex.org/W2359595284","https://openalex.org/W2008080870","https://openalex.org/W2897657622","https://openalex.org/W1831506627","https://openalex.org/W2091414672","https://openalex.org/W2269219693"],"abstract_inverted_index":{"The":[0,35],"chromatic":[1,19,36,46,64,80,88,92,98,108,136,165],"polynomial":[2,20,37,65,99,137],"gives":[3],"the":[4,18,30,63,97,117,135,140,153],"number":[5],"of":[6,9,17,29,32,38,66,100,110,119,122,128,150,155,167,169],"proper":[7],"$\\lambda$-colourings":[8],"a":[10,22,39,45,72,75,79,120,126,143],"graph":[11,40,73,103],"$G$.":[12],"This":[13],"paper":[14],"considers":[15],"factorisation":[16,47],"as":[21],"first":[23],"step":[24],"in":[25],"an":[26,147],"algebraic":[27,129],"study":[28],"roots":[31],"this":[33],"polynomial.":[34],"is":[41,60],"said":[42],"to":[43],"have":[44,91],"if":[48],"$P({G},\\lambda)=P({H_{1}},\\lambda)P({H_{2}},\\lambda)/P({K_{r}},\\lambda)$":[49],"for":[50,134,142,152,163],"some":[51],"graphs":[52,168],"$H_{1}$":[53],"and":[54,56,104,158],"$H_{2}$":[55],"clique":[57],"$K_{r}$.":[58],"It":[59],"known":[61],"that":[62,70,84,90,124,138],"any":[67,101],"clique-separable":[68,102],"graph,":[69],"is,":[71,125],"containing":[74],"separating":[76],"$r$-clique,":[77],"has":[78],"factorisation.":[81],"We":[82,115,145],"show":[83],"there":[85],"exist":[86],"other":[87],"polynomials":[89,109],"factorisations":[93,141,166],"but":[94],"are":[95],"not":[96],"identify":[105],"all":[106,164],"such":[107],"degree":[111],"at":[112],"most":[113],"10.":[114],"introduce":[116],"notion":[118],"certificate":[121],"factorisation,":[123],"sequence":[127],"transformations":[130],"based":[131],"on":[132],"identities":[133],"explains":[139],"graph.":[144],"find":[146,159],"upper":[148],"bound":[149],"$n^{2}2^{n^{2}/2}$":[151],"lengths":[154],"these":[156],"certificates,":[157],"much":[160],"smaller":[161],"certificates":[162],"order":[170],"$\\leq":[171],"9$.":[172]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-05T06:17:00.636019","created_date":"2025-10-10T00:00:00"}