{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T14:20:59Z","timestamp":1785421259791,"version":"3.56.0"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","issue":"Graph Theory","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,4,1]]},"abstract":"<jats:p xml:lang=\"en\">Neumann-Lara and \u0160krekovski conjectured that every planar digraph is 2-colourable. We show that this conjecture is equivalent to the more general statement that all oriented K_5-minor-free graphs are 2-colourable.<\/jats:p>","DOI":"10.23638\/dmtcs-22-4-11","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T12:56:53Z","timestamp":1743685013000},"source":"Crossref","is-referenced-by-count":0,"title":["A Note on Graphs of Dichromatic Number 2"],"prefix":"10.23638","volume":"vol. 22 no. 4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4234-6136","authenticated-orcid":false,"given":"Raphael","family":"Steiner","sequence":"first","affiliation":[{"id":[{"id":"https:\/\/ror.org\/03v4gjf40","id-type":"ROR","asserted-by":"publisher"}],"name":"Technical University of Berlin \/ Technische Universit\u00e4t Berlin"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"25203","published-online":{"date-parts":[[2021,1,5]]},"container-title":["Discrete Mathematics &amp; Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/hal.science\/hal-02178422v3\/document","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/hal.science\/hal-02178422v3\/document","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T12:56:53Z","timestamp":1743685013000},"score":1,"resource":{"primary":{"URL":"http:\/\/dmtcs.episciences.org\/5621"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,5]]},"references-count":0,"journal-issue":{"issue":"Graph Theory","published-online":{"date-parts":[[2021,1,5]]}},"URL":"https:\/\/doi.org\/10.23638\/dmtcs-22-4-11","relation":{"has-preprint":[{"id-type":"uri","id":"https:\/\/hal.science\/hal-02178422v2","asserted-by":"subject"},{"id-type":"uri","id":"https:\/\/hal.science\/hal-02178422v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"uri","id":"https:\/\/hal.science\/hal-02178422v3","asserted-by":"subject"}]},"ISSN":["1365-8050"],"issn-type":[{"value":"1365-8050","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,5]]},"article-number":"5621"}}