{"id":"https://openalex.org/W2613352448","doi":"https://doi.org/10.37236/4823","title":"A Construction of Uniquely $n$-Colorable Digraphs with Arbitrarily Large Digirth","display_name":"A Construction of Uniquely $n$-Colorable Digraphs with Arbitrarily Large Digirth","publication_year":2017,"publication_date":"2017-04-13","ids":{"openalex":"https://openalex.org/W2613352448","doi":"https://doi.org/10.37236/4823","mag":"2613352448"},"language":"en","primary_location":{"id":"doi:10.37236/4823","is_oa":true,"landing_page_url":"https://doi.org/10.37236/4823","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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://doi.org/10.37236/4823","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028435802","display_name":"Michael Severino","orcid":null},"institutions":[{"id":"https://openalex.org/I2799450551","display_name":"Flathead Valley Community College","ror":"https://ror.org/0126jpc81","country_code":"US","type":"education","lineage":["https://openalex.org/I2799450551"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael Severino","raw_affiliation_strings":["Flathead Valley Community College"],"affiliations":[{"raw_affiliation_string":"Flathead Valley Community College","institution_ids":["https://openalex.org/I2799450551"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5028435802"],"corresponding_institution_ids":["https://openalex.org/I2799450551"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.14360955,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"24","issue":"2","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.9983000159263611,"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.9983000159263611,"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.9965000152587891,"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.9886000156402588,"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/digraph","display_name":"Digraph","score":0.9514409303665161},{"id":"https://openalex.org/keywords/homomorphism","display_name":"Homomorphism","score":0.8718153238296509},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8107873797416687},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7644702792167664},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5420670509338379},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4676095247268677},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4206942021846771},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4151986837387085}],"concepts":[{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.9514409303665161},{"id":"https://openalex.org/C4042151","wikidata":"https://www.wikidata.org/wiki/Q215111","display_name":"Homomorphism","level":2,"score":0.8718153238296509},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8107873797416687},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7644702792167664},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5420670509338379},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4676095247268677},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4206942021846771},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4151986837387085}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/4823","is_oa":true,"landing_page_url":"https://doi.org/10.37236/4823","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.37236/4823","is_oa":true,"landing_page_url":"https://doi.org/10.37236/4823","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1485473234","https://openalex.org/W1507165844","https://openalex.org/W1597739364","https://openalex.org/W1999197342","https://openalex.org/W2035195165","https://openalex.org/W2037238859","https://openalex.org/W2126517143"],"related_works":["https://openalex.org/W1576493106","https://openalex.org/W2952009832","https://openalex.org/W2953006041","https://openalex.org/W2810282945","https://openalex.org/W1975341791","https://openalex.org/W2579513981","https://openalex.org/W2082494488","https://openalex.org/W2054349495","https://openalex.org/W2998116189","https://openalex.org/W2081358954"],"abstract_inverted_index":{"A":[0],"natural":[1],"digraph":[2,30,50,120,127,131,173,199],"analogue":[3,31],"of":[4,8,14,21,32,39,98,113,162,190],"the":[5,40,155],"graph-theoretic":[6,111],"concept":[7],"an":[9,15,181],"`independent":[10],"set'":[11],"is":[12,36,51,57,133,171],"that":[13,83,103,141,146],"`acyclic":[16],"set',":[17],"namely":[18],"a":[19,25,29,33,37,49,96,119,126,130,134,169,172,187],"set":[20,42],"vertices":[22],"not":[23,179],"spanning":[24],"directed":[26],"cycle.":[27],"Hence":[28],"graph":[34],"coloring":[35],"decomposition":[38,56],"vertex":[41],"into":[43],"acyclic":[44,123,182],"sets":[45],"and":[46,101,153,201],"we":[47,94,193],"say":[48],"uniquely":[52,86],"$n$-colorable":[53,87],"when":[54],"this":[55,167],"unique":[58],"up":[59],"to":[60,118,129,186],"relabeling.":[61],"It":[62],"was":[63],"shown":[64],"probabilistically":[65],"in":[66],"[A.":[67],"Harutyunyan":[68],"et":[69],"al.,":[70],"Uniquely":[71],"$D$-colorable":[72],"digraphs":[73,88,100],"with":[74,89],"large":[75,91],"girth,":[76],"Canad.":[77],"J.":[78],"Math.,":[79],"64(6):":[80],"1310-1328,":[81],"2012]":[82],"there":[84,177],"exist":[85,180],"arbitrarily":[90],"girth.":[92],"Here":[93,192],"give":[95],"construction":[97],"such":[99,140],"prove":[102,194],"they":[104],"have":[105],"circular":[106],"chromatic":[107,204],"number":[108],"$n$.":[109],"The":[110],"notion":[112],"`homomorphism'":[114],"also":[115],"gives":[116],"rise":[117],"analogue.":[121],"An":[122],"homomorphism":[124,183],"from":[125,184],"$D$":[128,174,185],"$H$":[132],"mapping":[135],"$\\varphi:":[136],"V(D)":[137],"\\rightarrow":[138],"V(H)$":[139],"$uv":[142],"\\in":[143,149,160],"A(D)$":[144],"implies":[145],"either":[147],"$\\varphi(u)\\varphi(v)":[148],"A(H)$":[150],"or":[151],"$\\varphi(u)=\\varphi(v)$,":[152],"all":[154],"`fibers'":[156],"$\\varphi^{-1}(v)$,":[157],"for":[158,175],"$v":[159],"V(H)$,":[161],"$\\varphi$":[163],"are":[164],"acyclic.":[165],"In":[166],"language,":[168],"core":[170],"which":[176],"does":[178],"proper":[188],"subdigraph":[189],"itself.":[191],"some":[195],"basic":[196],"results":[197],"about":[198],"cores":[200,205],"construct":[202],"highly":[203],"without":[206],"short":[207],"cycles.":[208]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}