{"id":"https://openalex.org/W2104281821","doi":"https://doi.org/10.1017/s0963548305007364","title":"The Complexity of Counting Colourings of Subgraphs of the Grid","display_name":"The Complexity of Counting Colourings of Subgraphs of the Grid","publication_year":2006,"publication_date":"2006-04-07","ids":{"openalex":"https://openalex.org/W2104281821","doi":"https://doi.org/10.1017/s0963548305007364","mag":"2104281821"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548305007364","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548305007364","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/391B1688125B63B72349F53002183972/S0963548305007364a.pdf/div-class-title-the-complexity-of-counting-colourings-of-subgraphs-of-the-grid-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/391B1688125B63B72349F53002183972/S0963548305007364a.pdf/div-class-title-the-complexity-of-counting-colourings-of-subgraphs-of-the-grid-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","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":true,"raw_author_name":"G. E. FARR","raw_affiliation_strings":["School of Computer Science and Software Engineering, Monash University (Clayton Campus), Clayton, Victoria 3800, Australia (e-mail:","School of Computer Science and Software Engineering, Monash University (Clayton Campus), Clayton, Victoria 3800, Australia (e-mail: graham.farr@infotech.monash.edu.au)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Software Engineering, Monash University (Clayton Campus), Clayton, Victoria 3800, Australia (e-mail:","institution_ids":["https://openalex.org/I56590836"]},{"raw_affiliation_string":"School of Computer Science and Software Engineering, Monash University (Clayton Campus), Clayton, Victoria 3800, Australia (e-mail: graham.farr@infotech.monash.edu.au)#TAB#","institution_ids":["https://openalex.org/I56590836"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5005637509"],"corresponding_institution_ids":["https://openalex.org/I56590836"],"apc_list":null,"apc_paid":null,"fwci":0.3241,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.64276906,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"15","issue":"3","first_page":"377","last_page":"383"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9990000128746033,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983000159263611,"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.8204250335693359},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7894300222396851},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6470563411712646},{"id":"https://openalex.org/keywords/lambda","display_name":"Lambda","score":0.6439729928970337},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6185408234596252},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5589404702186584},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5140146017074585},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4875185191631317},{"id":"https://openalex.org/keywords/square","display_name":"Square (algebra)","score":0.4753322899341583},{"id":"https://openalex.org/keywords/square-tiling","display_name":"Square tiling","score":0.42593446373939514},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2134971022605896},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07820001244544983}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8204250335693359},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7894300222396851},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6470563411712646},{"id":"https://openalex.org/C2778113609","wikidata":"https://www.wikidata.org/wiki/Q10897","display_name":"Lambda","level":2,"score":0.6439729928970337},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6185408234596252},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5589404702186584},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5140146017074585},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4875185191631317},{"id":"https://openalex.org/C135692309","wikidata":"https://www.wikidata.org/wiki/Q111124","display_name":"Square (algebra)","level":2,"score":0.4753322899341583},{"id":"https://openalex.org/C178650486","wikidata":"https://www.wikidata.org/wiki/Q1128619","display_name":"Square tiling","level":3,"score":0.42593446373939514},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2134971022605896},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07820001244544983},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1017/s0963548305007364","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548305007364","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/391B1688125B63B72349F53002183972/S0963548305007364a.pdf/div-class-title-the-complexity-of-counting-colourings-of-subgraphs-of-the-grid-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},{"id":"pmh:doi:10.26180/20707420","is_oa":false,"landing_page_url":"https://monash.hosted.exlibrisgroup.com/permalink/f/31uhmh/catau21143513770001751","pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Report"},{"id":"pmh:oai:figshare.com:article/20707420","is_oa":true,"landing_page_url":"https://figshare.com/articles/report/The_Complexity_of_Counting_Colourings_of_Subgraphs_of_the_Grid/20707420","pdf_url":null,"source":{"id":"https://openalex.org/S4306402621","display_name":"INDIGO (University of Illinois at Chicago)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39422238","host_organization_name":"University of Illinois Chicago","host_organization_lineage":["https://openalex.org/I39422238"],"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":"","raw_type":"Report"},{"id":"doi:10.26180/20707420.v1","is_oa":true,"landing_page_url":"https://doi.org/10.26180/20707420.v1","pdf_url":null,"source":{"id":"https://openalex.org/S7407052105","display_name":"Monash University","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Report"}],"best_oa_location":{"id":"doi:10.1017/s0963548305007364","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548305007364","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/391B1688125B63B72349F53002183972/S0963548305007364a.pdf/div-class-title-the-complexity-of-counting-colourings-of-subgraphs-of-the-grid-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2104281821.pdf","grobid_xml":"https://content.openalex.org/works/W2104281821.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W1490370380","https://openalex.org/W1530042113","https://openalex.org/W1968069760","https://openalex.org/W2000930415","https://openalex.org/W2002025203","https://openalex.org/W2003136749","https://openalex.org/W2011039300","https://openalex.org/W2039763834","https://openalex.org/W2057579192","https://openalex.org/W2077192094","https://openalex.org/W2080408506","https://openalex.org/W2085669706","https://openalex.org/W2094731577","https://openalex.org/W2102664288","https://openalex.org/W2155583863","https://openalex.org/W2156361153","https://openalex.org/W2991385428"],"related_works":["https://openalex.org/W2011928121","https://openalex.org/W4286901735","https://openalex.org/W4388906444","https://openalex.org/W1999426106","https://openalex.org/W2369743165","https://openalex.org/W4302773767","https://openalex.org/W4226107037","https://openalex.org/W281258432","https://openalex.org/W2108769088","https://openalex.org/W1970092645"],"abstract_inverted_index":{"It":[0,100],"is":[1,12,33,46,94],"well":[2],"known":[3,34],"that":[4,91],"counting":[5,51,81],"$\\lambda$":[6],"-colourings":[7],"(":[8],"$\\lambda\\geq":[9,97],"3$":[10,98],")":[11],"#P-complete":[13,95,102],"for":[14,19,40],"general":[15],"graphs,":[16],"and":[17,56],"also":[18],"several":[20],"restricted":[21,104],"classes":[22],"such":[23,57],"as":[24,62],"bipartite":[25],"planar":[26],"graphs.":[27],"On":[28],"the":[29,78,86,92],"other":[30],"hand,":[31],"it":[32],"to":[35,76,105],"be":[36,60],"polynomial":[37],"time":[38],"computable":[39],"graphs":[41,58,64],"of":[42,53,65,80,83,85],"bounded":[43],"tree-width.":[44],"There":[45],"often":[47],"special":[48],"interest":[49],"in":[50,68],"colourings":[52,82],"square":[54,87],"grids,":[55],"can":[59],"regarded":[61],"borderline":[63],"unbounded":[66],"tree-width":[67],"a":[69],"specific":[70],"sense.":[71],"We":[72,89],"are":[73],"thus":[74],"motivated":[75],"consider":[77],"complexity":[79],"subgraphs":[84,107],"grid.":[88],"show":[90],"problem":[93],"when":[96,103],".":[99],"remains":[101],"induced":[106],"with":[108],"maximum":[109],"degree":[110],"3.":[111]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}