<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>3051</id>
    <completedYear>2022</completedYear>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>578</pageFirst>
    <pageLast>595</pageLast>
    <pageNumber>18</pageNumber>
    <edition/>
    <issue>1</issue>
    <volume>36</volume>
    <type>article</type>
    <publisherName>Society for Industrial &amp; Applied Mathematics (SIAM)</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>2025-07-16</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Digraphs and Variable Degeneracy</title>
    <parentTitle language="eng">SIAM Journal on Discrete Mathematics</parentTitle>
    <identifier type="issn">0895-4801</identifier>
    <identifier type="doi">10.1137/20M1386827</identifier>
    <enrichment key="opus_doi_flag">true</enrichment>
    <enrichment key="opus_import_data">{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T02:24:49Z","timestamp":1747189489723,"version":"3.40.5"},"reference-count":27,"publisher":"Society for Industrial &amp; Applied Mathematics (SIAM)","issue":"1","funder":[{"DOI":"10.13039\/501100004836","name":"Det Frie Forskningsr\u00e5d","doi-asserted-by":"publisher","award":["DFF 7014-00037B"],"id":[{"id":"10.13039\/501100004836","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1137\/20m1386827","type":"journal-article","created":{"date-parts":[[2022,3,3]],"date-time":"2022-03-03T15:48:38Z","timestamp":1646322518000},"page":"578-595","source":"Crossref","is-referenced-by-count":2,"title":["Digraphs and Variable Degeneracy"],"prefix":"10.1137","volume":"36","author":[{"given":"J\u00f8rgen","family":"Bang-Jensen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4969-7115","authenticated-orcid":true,"given":"Thomas","family":"Schweser","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Stiebitz","sequence":"additional","affiliation":[]}],"member":"351","published-online":{"date-parts":[[2022,3,3]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.21811"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20325"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2009.03.028"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.37236\/8942"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.22535"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20003"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(78)90102-4"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)00221-6"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1017\/S030500410002168X"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.21847"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2006.164.51"},{"key":"atypb15","first-page":"125","author":"Erd\u00f6s P.","year":"1979","journal-title":"Canada"},{"key":"atypb16","first-page":"165","volume":"8","author":"Gallai T.","year":"1963","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2016.01.024"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.37236\/682"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1137\/100803870"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2012.01.028"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1145\/362248.362272"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-014-2862-4"},{"key":"atypb24","first-page":"23","volume":"30","author":"Kostochka A. V.","year":"1977","journal-title":"Metody Diskret. Anal."},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s2-9.3.459"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s2-4.4.577"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(77)90162-5"},{"key":"atypb28","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.10106"},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-005-0005-7"},{"key":"atypb30","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2009.05.027"},{"key":"atypb31","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(82)90046-6"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","deposited":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T18:10:33Z","timestamp":1651515033000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/20M1386827"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["10.1137\/20M1386827"],"URL":"https:\/\/doi.org\/10.1137\/20m1386827","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"type":"print","value":"0895-4801"},{"type":"electronic","value":"1095-7146"}],"subject":[],"published":{"date-parts":[[2022,3]]}}}</enrichment>
    <enrichment key="local_crossrefDocumentType">journal-article</enrichment>
    <enrichment key="local_import_origin">crossref</enrichment>
    <enrichment key="local_doiImportPopulated">PersonAuthorFirstName_1,PersonAuthorLastName_1,PersonAuthorFirstName_2,PersonAuthorLastName_2,PersonAuthorIdentifierOrcid_2,PersonAuthorFirstName_3,PersonAuthorLastName_3,PublisherName,TitleMain_1,Language,TitleParent_1,PageNumber,PageFirst,PageLast,Issue,Volume,CompletedYear,IdentifierIssn</enrichment>
    <enrichment key="opus.source">doi-import</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <enrichment key="review.accepted_by">2</enrichment>
    <author>Jørgen Bang-Jensen</author>
    <author>Thomas Schweser</author>
    <author>Michael Stiebitz</author>
  </doc>
  <doc>
    <id>3056</id>
    <completedYear>2019</completedYear>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>76</pageFirst>
    <pageLast>98</pageLast>
    <pageNumber>23</pageNumber>
    <edition/>
    <issue>1</issue>
    <volume>95</volume>
    <type>article</type>
    <publisherName>Wiley</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>2025-07-17</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">On DP‐coloring of digraphs</title>
    <abstract language="eng">DP‐coloring is a relatively new coloring concept by Dvořák and Postle and was introduced as an extension of list‐colorings of (undirected) graphs. It transforms the problem of finding a list‐coloring of a given graph with a list‐assignment to finding an independent transversal in an auxiliary graph with vertex set . In this paper, we extend the definition of DP‐colorings to digraphs using the approach from Neumann‐Lara where a coloring of a digraph is a coloring of the vertices such that the digraph does not contain any monochromatic directed cycle. Furthermore, we prove a Brooks’ type theorem regarding the DP‐chromatic number, which extends various results on the (list‐)chromatic number of digraphs.</abstract>
    <parentTitle language="eng">Journal of Graph Theory</parentTitle>
    <identifier type="issn">0364-9024</identifier>
    <identifier type="doi">10.1002/jgt.22535</identifier>
    <enrichment key="opus_doi_flag">true</enrichment>
    <enrichment key="opus_import_data">{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:16:09Z","timestamp":1740104169494,"version":"3.37.3"},"reference-count":18,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2019,12,17]],"date-time":"2019-12-17T00:00:00Z","timestamp":1576540800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Independent Research Fond Denmark DFF","award":["7014-00037B"]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[2020,9]]},"abstract":"&lt;jats:title&gt;Abstract&lt;\/jats:title&gt;&lt;jats:p&gt;DP\u2010coloring is a relatively new coloring concept by Dvo\u0159\u00e1k and Postle and was introduced as an extension of list\u2010colorings of (undirected) graphs. It transforms the problem of finding a list\u2010coloring of a given graph  with a list\u2010assignment  to finding an independent transversal in an auxiliary graph with vertex set . In this paper, we extend the definition of DP\u2010colorings to digraphs using the approach from Neumann\u2010Lara where a coloring of a digraph is a coloring of the vertices such that the digraph does not contain any monochromatic directed cycle. Furthermore, we prove a Brooks\u2019 type theorem regarding the DP\u2010chromatic number, which extends various results on the (list\u2010)chromatic number of digraphs.&lt;\/jats:p&gt;","DOI":"10.1002\/jgt.22535","type":"journal-article","created":{"date-parts":[[2019,12,17]],"date-time":"2019-12-17T08:31:26Z","timestamp":1576571486000},"page":"76-98","update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On DP\u2010coloring of digraphs"],"prefix":"10.1002","volume":"95","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5783-7125","authenticated-orcid":false,"given":"J\u00f8rgen","family":"Bang\u2010Jensen","sequence":"first","affiliation":[{"name":"IMADA University of Southern Denmark  Odense M Denmark"}]},{"given":"Thomas","family":"Bellitto","sequence":"additional","affiliation":[{"name":"IMADA University of Southern Denmark  Odense M Denmark"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4969-7115","authenticated-orcid":false,"given":"Thomas","family":"Schweser","sequence":"additional","affiliation":[{"name":"Institute of Mathematics Technische Universit\u00e4t Ilmenau  Ilmenau Germany"}]},{"given":"Michael","family":"Stiebitz","sequence":"additional","affiliation":[{"name":"Institute of Mathematics Technische Universit\u00e4t Ilmenau  Ilmenau Germany"}]}],"member":"311","published-online":{"date-parts":[[2019,12,17]]},"reference":[{"volume-title":"Digraphs: Theory, Algorithms and Applications","year":"2008","author":"Bang\u2010Jensen J.","key":"e_1_2_6_2_1"},{"key":"e_1_2_6_3_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.22170"},{"key":"e_1_2_6_4_1","doi-asserted-by":"publisher","DOI":"10.1134\/S0037446617010049"},{"key":"e_1_2_6_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2017.05.007"},{"key":"e_1_2_6_6_1","doi-asserted-by":"publisher","DOI":"10.1017\/S030500410002168X"},{"key":"e_1_2_6_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2017.09.001"},{"key":"e_1_2_6_8_1","unstructured":"P.Erd\u0151s Problems and results in number theory and graphs theory Proceedings of the 9th Manitoba Conference on Numerical Mathematics and Computing 1979 pp.3\u201321."},{"key":"e_1_2_6_9_1","first-page":"125","article-title":"Choosability in graphs","author":"Erd\u0151s P.","year":"1979","journal-title":"Congr. Numer."},{"key":"e_1_2_6_10_1","doi-asserted-by":"crossref","unstructured":"P.Fraigniaud M.Heinrich andA.Kosowski Local conflict coloring 57th Annual Symposium on Foundations of Computer Science (FOCS) 2016 pp .625\u2013634.","DOI":"10.1109\/FOCS.2016.73"},{"key":"e_1_2_6_11_1","doi-asserted-by":"publisher","DOI":"10.37236\/682"},{"key":"e_1_2_6_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/100803870"},{"key":"e_1_2_6_13_1","unstructured":"A.Johansson Asymptotic choice number for triangle free graphs DIMACS Technical Report 91\u20104 1196 1996."},{"key":"e_1_2_6_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.22425"},{"key":"e_1_2_6_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2009.05.027"},{"key":"e_1_2_6_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(82)90046-6"},{"key":"e_1_2_6_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.21819"},{"key":"e_1_2_6_18_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.10033"},{"key":"e_1_2_6_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.09.010"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.22535","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.22535","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1002\/jgt.22535","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.22535","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T17:07:56Z","timestamp":1693847276000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.22535"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,17]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["10.1002\/jgt.22535"],"URL":"https:\/\/doi.org\/10.1002\/jgt.22535","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"type":"print","value":"0364-9024"},{"type":"electronic","value":"1097-0118"}],"subject":[],"published":{"date-parts":[[2019,12,17]]},"assertion":[{"value":"2018-12-23","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-12-04","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-12-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}</enrichment>
    <enrichment key="local_crossrefDocumentType">journal-article</enrichment>
    <enrichment key="local_crossrefLicence">http://creativecommons.org/licenses/by/4.0/</enrichment>
    <enrichment key="local_import_origin">crossref</enrichment>
    <enrichment key="local_doiImportPopulated">PersonAuthorFirstName_1,PersonAuthorLastName_1,PersonAuthorIdentifierOrcid_1,PersonAuthorFirstName_2,PersonAuthorLastName_2,PersonAuthorFirstName_3,PersonAuthorLastName_3,PersonAuthorIdentifierOrcid_3,PersonAuthorFirstName_4,PersonAuthorLastName_4,PublisherName,TitleMain_1,Language,TitleAbstract_1,TitleParent_1,PageNumber,PageFirst,PageLast,Issue,Volume,CompletedYear,IdentifierIssn,Enrichmentlocal_crossrefLicence</enrichment>
    <enrichment key="opus.source">doi-import</enrichment>
    <enrichment key="review.accepted_by">2</enrichment>
    <author>Jørgen Bang‐Jensen</author>
    <author>Thomas Bellitto</author>
    <author>Thomas Schweser</author>
    <author>Michael Stiebitz</author>
  </doc>
  <doc>
    <id>3055</id>
    <completedYear>2020</completedYear>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue>1</issue>
    <volume>27</volume>
    <type>article</type>
    <publisherName>The Electronic Journal of Combinatorics</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>2025-07-17</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Hajós and Ore Constructions for Digraphs</title>
    <parentTitle language="eng">The Electronic Journal of Combinatorics</parentTitle>
    <identifier type="issn">1077-8926</identifier>
    <identifier type="doi">10.37236/8942</identifier>
    <enrichment key="opus_doi_flag">true</enrichment>
    <enrichment key="opus_import_data">{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T01:23:52Z","timestamp":1752283432940},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"&lt;jats:p&gt;The dichromatic number $\\overrightarrow{\\chi}(D)$\u00a0of a digraph $D$ is the minimum number of colors needed to color the vertices of $D$ such that each color class induces an acyclic subdigraph of $D$. A digraph $D$ is $k$-critical if $\\overrightarrow{\\chi}(D) = k$ but $\\overrightarrow{\\chi}(D') &amp;lt; k$ for all proper subdigraphs $D'$ of $D$. We examine methods for creating infinite families of critical digraphs, the Dirac join and the directed and bidirected Haj\u00f3s join. We prove that a digraph $D$ has dichromatic number at least $k$ if and only if it contains a subdigraph that can be obtained from bidirected complete graphs on $k$ vertices by directed Haj\u00f3s joins and identifying non-adjacent vertices. Building upon that, we show that a digraph $D$ has dichromatic number at least $k$ if and only if it can be constructed from bidirected $K_k$'s by using directed and bidirected Haj\u00f3s joins and identifying non-adjacent vertices (so called Ore joins), thereby transferring a well-known result of Urquhart to digraphs. Finally, we prove a Gallai-type theorem that characterizes the structure of the low vertex subdigraph of a critical digraph, that is, the subdigraph, which is induced by the vertices that have in-degree $k-1$ and out-degree $k-1$ in $D$.&lt;\/jats:p&gt;","DOI":"10.37236\/8942","type":"journal-article","created":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T00:44:15Z","timestamp":1584578655000},"source":"Crossref","is-referenced-by-count":7,"title":["Haj\u00f3s and Ore Constructions for Digraphs"],"prefix":"10.37236","volume":"27","author":[{"given":"J\u00f8rgen","family":"Bang-Jensen","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Bellitto","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Schweser","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Stiebitz","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2020,3,20]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v27i1p63\/8050","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v27i1p63\/8050","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T00:44:15Z","timestamp":1584578655000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v27i1p63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,20]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2020,1,9]]}},"URL":"https:\/\/doi.org\/10.37236\/8942","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,20]]}}}</enrichment>
    <enrichment key="local_crossrefDocumentType">journal-article</enrichment>
    <enrichment key="local_import_origin">crossref</enrichment>
    <enrichment key="local_doiImportPopulated">PersonAuthorFirstName_1,PersonAuthorLastName_1,PersonAuthorFirstName_2,PersonAuthorLastName_2,PersonAuthorFirstName_3,PersonAuthorLastName_3,PersonAuthorFirstName_4,PersonAuthorLastName_4,PublisherName,TitleMain_1,TitleAbstract_1,TitleParent_1,Issue,Volume,CompletedYear,IdentifierIssn</enrichment>
    <enrichment key="opus.source">doi-import</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <enrichment key="review.accepted_by">2</enrichment>
    <author>Jørgen Bang-Jensen</author>
    <author>Thomas Bellitto</author>
    <author>Thomas Schweser</author>
    <author>Michael Stiebitz</author>
  </doc>
</export-example>
