{"id":"https://openalex.org/W2757265255","doi":"https://doi.org/10.1145/3282431","title":"Surjective H-Colouring over Reflexive Digraphs","display_name":"Surjective H-Colouring over Reflexive Digraphs","publication_year":2018,"publication_date":"2018-11-21","ids":{"openalex":"https://openalex.org/W2757265255","doi":"https://doi.org/10.1145/3282431","mag":"2757265255"},"language":"en","primary_location":{"id":"doi:10.1145/3282431","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3282431","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://dro.dur.ac.uk/24227/","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016192081","display_name":"Beno\u00eet Larose","orcid":null},"institutions":[{"id":"https://openalex.org/I159129438","display_name":"Universit\u00e9 du Qu\u00e9bec \u00e0 Montr\u00e9al","ror":"https://ror.org/002rjbv21","country_code":"CA","type":"education","lineage":["https://openalex.org/I159129438","https://openalex.org/I49663120"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Beno\u00eet Larose","raw_affiliation_strings":["LACIM, Universit\u00e9 du Qu\u00e9bec a Montr\u00e9al, Canada","LaCIM, Universit\u00e9 du Qu\u00e9bec \u00e0 Montreal, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LACIM, Universit\u00e9 du Qu\u00e9bec a Montr\u00e9al, Canada","institution_ids":["https://openalex.org/I159129438"]},{"raw_affiliation_string":"LaCIM, Universit\u00e9 du Qu\u00e9bec \u00e0 Montreal, Canada","institution_ids":["https://openalex.org/I159129438"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013230954","display_name":"Barnaby Martin","orcid":"https://orcid.org/0000-0002-4642-8614"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Barnaby Martin","raw_affiliation_strings":["Department of Computer Science, Durham University, U.K","Department of Computer Science, Durham University, U.K#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University, U.K","institution_ids":["https://openalex.org/I190082696"]},{"raw_affiliation_string":"Department of Computer Science, Durham University, U.K#TAB#","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027487467","display_name":"Dani\u00ebl Paulusma","orcid":"https://orcid.org/0000-0001-5945-9287"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Dani\u00ebl Paulusma","raw_affiliation_strings":["Department of Computer Science, Durham University, U.K","Department of Computer Science, Durham University, U.K#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University, U.K","institution_ids":["https://openalex.org/I190082696"]},{"raw_affiliation_string":"Department of Computer Science, Durham University, U.K#TAB#","institution_ids":["https://openalex.org/I190082696"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5016192081"],"corresponding_institution_ids":["https://openalex.org/I159129438"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.02789039,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"11","issue":"1","first_page":"1","last_page":"21"},"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9846000075340271,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9828000068664551,"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/surjective-function","display_name":"Surjective function","score":0.934124231338501},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8045122623443604},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5803636312484741},{"id":"https://openalex.org/keywords/homomorphism","display_name":"Homomorphism","score":0.5552703738212585},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.5472670197486877},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4430503845214844},{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.4379408657550812},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.43342727422714233}],"concepts":[{"id":"https://openalex.org/C119238805","wikidata":"https://www.wikidata.org/wiki/Q229102","display_name":"Surjective function","level":2,"score":0.934124231338501},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8045122623443604},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5803636312484741},{"id":"https://openalex.org/C4042151","wikidata":"https://www.wikidata.org/wiki/Q215111","display_name":"Homomorphism","level":2,"score":0.5552703738212585},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.5472670197486877},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4430503845214844},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.4379408657550812},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.43342727422714233}],"mesh":[],"locations_count":10,"locations":[{"id":"doi:10.1145/3282431","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3282431","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:24227","is_oa":true,"landing_page_url":"http://dro.dur.ac.uk/24227/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196258","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Niedermeier,  Rolf & Vall\u00e9e,  Brigitte (Eds.). (2018). 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018) : February 28\u2013March 3, 2018, Caen, France. Dagstuhl, Germany: Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, pp. 49:1-49:14, Leibniz International Proceedings in Informatics (LIPIcs)(96)","raw_type":"Book chapter"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:26147","is_oa":false,"landing_page_url":"http://dro.dur.ac.uk/26147/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196258","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"ACM transactions on computation theory, 2018, Vol.11(1), pp.3 [Peer Reviewed Journal]","raw_type":"Article"},{"id":"pmh:oai:arXiv.org:1709.09486","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1709.09486","pdf_url":"https://arxiv.org/pdf/1709.09486","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},{"id":"mag:2757265255","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1709.09486.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:drops-oai.dagstuhl.de:8488","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.49","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"InProceedings"},{"id":"pmh:oai:durham-repository.worktribe.com:1145132","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1145132","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"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":"publishedVersion"},{"id":"pmh:oai:durham-repository.worktribe.com:1320642","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1320642","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"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":"acceptedVersion"},{"id":"doi:10.48550/arxiv.1709.09486","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1709.09486","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"article"},{"id":"doi:10.4230/lipics.stacs.2018.49","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.stacs.2018.49","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:dro.dur.ac.uk.OAI2:24227","is_oa":true,"landing_page_url":"http://dro.dur.ac.uk/24227/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196258","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Niedermeier,  Rolf & Vall\u00e9e,  Brigitte (Eds.). (2018). 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018) : February 28\u2013March 3, 2018, Caen, France. Dagstuhl, Germany: Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, pp. 49:1-49:14, Leibniz International Proceedings in Informatics (LIPIcs)(96)","raw_type":"Book chapter"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G51464283","display_name":null,"funder_award_id":"RPG-2016-258","funder_id":"https://openalex.org/F4320319993","funder_display_name":"Leverhulme Trust"}],"funders":[{"id":"https://openalex.org/F4320319993","display_name":"Leverhulme Trust","ror":"https://ror.org/012mzw131"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"},{"id":"https://openalex.org/F4320334841","display_name":"Fonds de recherche du Qu\u00e9bec \u2013 Nature et technologies","ror":"https://ror.org/00b9f9778"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W655258421","https://openalex.org/W1982336851","https://openalex.org/W1983788780","https://openalex.org/W1996330905","https://openalex.org/W1998601876","https://openalex.org/W2018547288","https://openalex.org/W2023673835","https://openalex.org/W2026753685","https://openalex.org/W2029406200","https://openalex.org/W2032487621","https://openalex.org/W2033470072","https://openalex.org/W2033649868","https://openalex.org/W2038274600","https://openalex.org/W2048988825","https://openalex.org/W2051028069","https://openalex.org/W2051731147","https://openalex.org/W2056827961","https://openalex.org/W2073159267","https://openalex.org/W2079906810","https://openalex.org/W2132911512","https://openalex.org/W2150339067","https://openalex.org/W2591988591","https://openalex.org/W2605041732","https://openalex.org/W2606192553","https://openalex.org/W2773731510","https://openalex.org/W2786954219","https://openalex.org/W2950964988","https://openalex.org/W2962785950","https://openalex.org/W2963006808","https://openalex.org/W2963569011","https://openalex.org/W2963768895","https://openalex.org/W3139132595"],"related_works":["https://openalex.org/W2052903450","https://openalex.org/W2051731147","https://openalex.org/W1825515612","https://openalex.org/W1976525036","https://openalex.org/W3128811621","https://openalex.org/W3012864922","https://openalex.org/W2952406598","https://openalex.org/W2963967898","https://openalex.org/W2014735387","https://openalex.org/W125810018","https://openalex.org/W2579513981","https://openalex.org/W2897477041","https://openalex.org/W2055646787","https://openalex.org/W2169872958","https://openalex.org/W3001481731","https://openalex.org/W2027983301","https://openalex.org/W2965870188","https://openalex.org/W1576493106","https://openalex.org/W3108139882","https://openalex.org/W2053242449"],"abstract_inverted_index":{"The":[0,22],"S":[1,68,90,145,160,187],"urjective":[2,69,91,146,161,188],"H-C":[3,70,92,147,162,189],"olouring":[4,71,93,148,163,190],"problem":[5,26],"is":[6,94,151,157,164,169,193],"to":[7,17,63,136],"test":[8],"if":[9,96,155],"a":[10,14,18,43,61,142,152,183,194],"given":[11],"graph":[12,20],"allows":[13],"vertex-surjective":[15],"homomorphism":[16],"fixed":[19],"H.":[21],"complexity":[23,184],"of":[24,42,47,55,67,75,85,103,115,134,198],"this":[25,127,173],"has":[27,98,126],"been":[28],"well":[29],"studied":[30],"for":[31,144,186],"undirected":[32],"(partially)":[33],"reflexive":[34,76,123,153,196],"graphs.":[35],"We":[36,109,129],"introduce":[37],"endo-triviality":[38,135],",":[39],"the":[40,73,83,99,111,132],"property":[41,100],"structure":[44],"that":[45,50,89,101,120],"all":[46,102],"its":[48,104],"endomorphisms":[49],"do":[51],"not":[52],"have":[53],"range":[54],"size":[56,199],"1":[57],"are":[58,106],"automorphisms,":[59],"as":[60,138],"means":[62],"obtain":[64,182],"complexity-theoretic":[65],"classifications":[66],"in":[72,82,165],"case":[74],"digraphs":[77],".":[78],"Chen":[79],"(2014)":[80],"proved,":[81],"setting":[84],"constraint":[86],"satisfaction":[87],"problems,":[88],"NP-complete":[95],"H":[97,125,150,156,192],"polymorphisms":[105],"essentially":[107],"unary.":[108],"give":[110],"first":[112],"concrete":[113],"application":[114],"his":[116],"result":[117,174],"by":[118],"showing":[119],"every":[121],"endo-trivial":[122],"digraph":[124,197],"property.":[128],"then":[130,159],"use":[131],"concept":[133],"prove,":[137],"our":[139],"main":[140],"result,":[141],"dichotomy":[143],"when":[149,191],"tournament:":[154],"transitive,":[158],"NL;":[166],"otherwise,":[167],"it":[168],"NP-complete.":[170],"By":[171],"combining":[172],"with":[175],"some":[176],"known":[177],"and":[178],"new":[179],"results,":[180],"we":[181],"classification":[185],"partially":[195],"at":[200],"most":[201],"3.":[202]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}