{"id":"https://openalex.org/W2929306367","doi":"https://doi.org/10.3390/a12040087","title":"Oriented Coloring on Recursively Defined Digraphs","display_name":"Oriented Coloring on Recursively Defined Digraphs","publication_year":2019,"publication_date":"2019-04-25","ids":{"openalex":"https://openalex.org/W2929306367","doi":"https://doi.org/10.3390/a12040087","mag":"2929306367"},"language":"en","primary_location":{"id":"doi:10.3390/a12040087","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a12040087","pdf_url":"https://www.mdpi.com/1999-4893/12/4/87/pdf?version=1556258480","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/12/4/87/pdf?version=1556258480","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Frank Gurski","orcid":null},"institutions":[{"id":"https://openalex.org/I44260953","display_name":"Heinrich Heine University D\u00fcsseldorf","ror":"https://ror.org/024z2rq82","country_code":"DE","type":"education","lineage":["https://openalex.org/I44260953"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Frank Gurski","raw_affiliation_strings":["Algorithmics for Hard Problems Group, Institute of Computer Science, Heinrich Heine University D\u00fcsseldorf, 40225 D\u00fcsseldorf, Germany"],"affiliations":[{"raw_affiliation_string":"Algorithmics for Hard Problems Group, Institute of Computer Science, Heinrich Heine University D\u00fcsseldorf, 40225 D\u00fcsseldorf, Germany","institution_ids":["https://openalex.org/I44260953"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Dominique Komander","orcid":null},"institutions":[{"id":"https://openalex.org/I44260953","display_name":"Heinrich Heine University D\u00fcsseldorf","ror":"https://ror.org/024z2rq82","country_code":"DE","type":"education","lineage":["https://openalex.org/I44260953"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Dominique Komander","raw_affiliation_strings":["Algorithmics for Hard Problems Group, Institute of Computer Science, Heinrich Heine University D\u00fcsseldorf, 40225 D\u00fcsseldorf, Germany"],"affiliations":[{"raw_affiliation_string":"Algorithmics for Hard Problems Group, Institute of Computer Science, Heinrich Heine University D\u00fcsseldorf, 40225 D\u00fcsseldorf, Germany","institution_ids":["https://openalex.org/I44260953"]}]},{"author_position":"last","author":{"id":null,"display_name":"Carolin Rehs","orcid":"https://orcid.org/0000-0002-8788-1028"},"institutions":[{"id":"https://openalex.org/I44260953","display_name":"Heinrich Heine University D\u00fcsseldorf","ror":"https://ror.org/024z2rq82","country_code":"DE","type":"education","lineage":["https://openalex.org/I44260953"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Carolin Rehs","raw_affiliation_strings":["Algorithmics for Hard Problems Group, Institute of Computer Science, Heinrich Heine University D\u00fcsseldorf, 40225 D\u00fcsseldorf, Germany"],"affiliations":[{"raw_affiliation_string":"Algorithmics for Hard Problems Group, Institute of Computer Science, Heinrich Heine University D\u00fcsseldorf, 40225 D\u00fcsseldorf, Germany","institution_ids":["https://openalex.org/I44260953"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I44260953"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":1.7997,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.86304557,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"12","issue":"4","first_page":"87","last_page":"87"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.6582000255584717,"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.6582000255584717,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.27059999108314514,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.020899999886751175,"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/chromatic-scale","display_name":"Chromatic scale","score":0.5221999883651733},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.5134000182151794},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.4645000100135803},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.45350000262260437},{"id":"https://openalex.org/keywords/graph-homomorphism","display_name":"Graph homomorphism","score":0.42579999566078186},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.4251999855041504},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40059998631477356},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.3725999891757965},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.34929999709129333}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.683899998664856},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6115999817848206},{"id":"https://openalex.org/C196956537","wikidata":"https://www.wikidata.org/wiki/Q202021","display_name":"Chromatic scale","level":2,"score":0.5221999883651733},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5171999931335449},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.5134000182151794},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.4645000100135803},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.45350000262260437},{"id":"https://openalex.org/C7036158","wikidata":"https://www.wikidata.org/wiki/Q3385162","display_name":"Graph homomorphism","level":5,"score":0.42579999566078186},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.4251999855041504},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40059998631477356},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.3725999891757965},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.34929999709129333},{"id":"https://openalex.org/C198414033","wikidata":"https://www.wikidata.org/wiki/Q5155607","display_name":"Comparability graph","level":5,"score":0.3346000015735626},{"id":"https://openalex.org/C199594403","wikidata":"https://www.wikidata.org/wiki/Q1130404","display_name":"List coloring","level":5,"score":0.334199994802475},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.3336000144481659},{"id":"https://openalex.org/C167750561","wikidata":"https://www.wikidata.org/wiki/Q1789512","display_name":"Critical graph","level":5,"score":0.3222000002861023},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.32030001282691956},{"id":"https://openalex.org/C158319403","wikidata":"https://www.wikidata.org/wiki/Q5477527","display_name":"Fractional coloring","level":5,"score":0.31839999556541443},{"id":"https://openalex.org/C2333172","wikidata":"https://www.wikidata.org/wiki/Q1425985","display_name":"Preorder","level":2,"score":0.3179999887943268},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3098999857902527},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.30250000953674316},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.2872999906539917},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.27410000562667847},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.2721000015735626},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.27160000801086426},{"id":"https://openalex.org/C73380178","wikidata":"https://www.wikidata.org/wiki/Q8024306","display_name":"Windmill graph","level":5,"score":0.2599000036716461}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3390/a12040087","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a12040087","pdf_url":"https://www.mdpi.com/1999-4893/12/4/87/pdf?version=1556258480","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1904.01570","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1904.01570","pdf_url":"https://arxiv.org/pdf/1904.01570","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":"pmh:oai:doaj.org/article:c331b74672fd446db9b3f0e6d0b310c2","is_oa":true,"landing_page_url":"https://doaj.org/article/c331b74672fd446db9b3f0e6d0b310c2","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 12, Iss 4, p 87 (2019)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/12/4/87/","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3390/a12040087","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"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":"Algorithms","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a12040087","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a12040087","pdf_url":"https://www.mdpi.com/1999-4893/12/4/87/pdf?version=1556258480","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8050995652","display_name":null,"funder_award_id":"GU 970/7-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2929306367.pdf","grobid_xml":"https://content.openalex.org/works/W2929306367.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W655258421","https://openalex.org/W1563008855","https://openalex.org/W1970463374","https://openalex.org/W1993328543","https://openalex.org/W2011254347","https://openalex.org/W2013932745","https://openalex.org/W2028775537","https://openalex.org/W2036648964","https://openalex.org/W2054167510","https://openalex.org/W2095917812","https://openalex.org/W2146463098","https://openalex.org/W2195002222","https://openalex.org/W2593877318","https://openalex.org/W2810018852","https://openalex.org/W3022173737","https://openalex.org/W4231773516","https://openalex.org/W4240084004","https://openalex.org/W4240899876","https://openalex.org/W6632790082","https://openalex.org/W6635467479","https://openalex.org/W6675137806","https://openalex.org/W6689017417","https://openalex.org/W6793117579"],"related_works":[],"abstract_inverted_index":{"Coloring":[0],"is":[1,47,82,102,115,192],"one":[2],"of":[3,36,50,66,77,111,176,197],"the":[4,51,62,70,83,108,124,157,165,172,177,188,195,208],"most":[5],"famous":[6],"problems":[7,29],"in":[8,218],"graph":[9,39,80,114,135,209],"theory.":[10],"The":[11,73],"coloring":[12,28,148],"problem":[13,125,211],"on":[14,30,126,212],"undirected":[15],"graphs":[16],"has":[17],"been":[18],"well":[19],"studied,":[20],"whereas":[21],"there":[22],"are":[23],"very":[24],"few":[25],"results":[26],"for":[27,133,149,164],"directed":[31],"graphs.":[32],"An":[33],"oriented":[34,38,74,79,91,100,113,127,147,151,158,173,179,186,189,200,213],"k-coloring":[35],"an":[37,78,90,95,99,112,116,145,150],"G":[40,81,88],"=":[41],"(":[42],"V":[43,54],",":[44],"A":[45],")":[46],"a":[48,139,198],"partition":[49],"vertex":[52],"set":[53],"into":[55],"k":[56,85],"independent":[57],"sets":[58],"such":[59,86],"that":[60,87,106,184,207],"all":[61],"arcs":[63],"linking":[64],"two":[65],"these":[67],"subsets":[68],"have":[69],"same":[71],"direction.":[72],"chromatic":[75,109,159,174,190],"number":[76,110,160,175,191],"smallest":[84],"allows":[89,98],"k-coloring.":[92],"Deciding":[93],"whether":[94],"acyclic":[96],"digraph":[97],"4-coloring":[101],"NP-hard.":[103],"It":[104,181],"follows":[105],"finding":[107],"NP-hard":[117],"problem,":[118],"too.":[119],"This":[120],"motivates":[121],"to":[122,194],"consider":[123],"co-graphs.":[128,180],"After":[129],"giving":[130],"several":[131],"characterizations":[132],"this":[134],"class,":[136],"we":[137],"show":[138,206],"linear":[140,219],"time":[141],"algorithm":[142],"which":[143],"computes":[144],"optimal":[146],"co-graph.":[152],"We":[153,204],"further":[154],"prove":[155],"how":[156],"can":[161,215],"be":[162,216],"computed":[163],"disjoint":[166],"union":[167],"and":[168],"order":[169],"composition":[170],"from":[171],"involved":[178],"turns":[182],"out":[183],"within":[185],"co-graphs":[187,214],"equal":[193],"length":[196],"longest":[199],"path":[201],"plus":[202],"one.":[203],"also":[205],"isomorphism":[210],"solved":[217],"time.":[220]},"counts_by_year":[{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2019-04-11T00:00:00"}