{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:53:35Z","timestamp":1743126815550,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030799861"},{"type":"electronic","value":"9783030799878"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-79987-8_14","type":"book-chapter","created":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:05:05Z","timestamp":1625007905000},"page":"194-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Oriented Coloring of the Disjoint Union of Graphs"],"prefix":"10.1007","author":[{"given":"Erika Morais Martins","family":"Coelho","sequence":"first","affiliation":[]},{"given":"Hebert","family":"Coelho","sequence":"additional","affiliation":[]},{"given":"Luerbio","family":"Faria","sequence":"additional","affiliation":[]},{"given":"Mateus de Paula","family":"Ferreira","sequence":"additional","affiliation":[]},{"given":"Sylvain","family":"Gravier","sequence":"additional","affiliation":[]},{"given":"Sulamita","family":"Klein","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,30]]},"reference":[{"issue":"4","key":"14_CR1","doi-asserted-by":"publisher","first-page":"675","DOI":"10.7151\/dmgt.1572","volume":"31","author":"NR Aravind","year":"2011","unstructured":"Aravind, N.R., Narayanan, N., Subramanian, C.R.: Oriented colouring of some graph products. Discuss. Math. Graph Theory 31(4), 675\u2013686 (2011). https:\/\/doi.org\/10.7151\/dmgt.1572","journal-title":"Discuss. Math. Graph Theory"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.dam.2015.06.023","volume":"198","author":"H Coelho","year":"2016","unstructured":"Coelho, H., Faria, L., Gravier, S., Klein, S.: Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs. Discret. Appl. Math. 198, 109\u2013117 (2016). https:\/\/doi.org\/10.1016\/j.dam.2015.06.023","journal-title":"Discret. Appl. Math."},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/11611257_20","volume-title":"SOFSEM 2006: Theory and Practice of Computer Science","author":"J-F Culus","year":"2006","unstructured":"Culus, J.-F., Demange, M.: Oriented coloring: complexity and approximation. In: Wiedermann, J., Tel, G., Pokorn\u00fd, J., Bielikov\u00e1, M., \u0160tuller, J. (eds.) SOFSEM 2006. LNCS, vol. 3831, pp. 226\u2013236. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11611257_20"},{"issue":"1","key":"14_CR4","doi-asserted-by":"publisher","first-page":"211","DOI":"10.7151\/dmgt.2074","volume":"39","author":"J Dybizbanski","year":"2019","unstructured":"Dybizbanski, J., Nenca, A.: Oriented chromatic number of cartesian products and strong products of paths. Discuss. Math. Graph Theory 39(1), 211\u2013223 (2019). https:\/\/doi.org\/10.7151\/dmgt.2074","journal-title":"Discuss. Math. Graph Theory"},{"issue":"5","key":"14_CR5","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0020-0190(02)00405-2","volume":"85","author":"G Fertin","year":"2003","unstructured":"Fertin, G., Raspaud, A., Roychowdhury, A.: On the oriented chromatic number of grids. Inf. Proc. Lett. 85(5), 261\u2013266 (2003). https:\/\/doi.org\/10.1016\/S0020-0190(02)00405-2","journal-title":"Inf. Proc. Lett."},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/978-3-642-11266-9_36","volume-title":"SOFSEM 2010: Theory and Practice of Computer Science","author":"R Ganian","year":"2010","unstructured":"Ganian, R., Hlin\u011bn\u00fd, P.: New results on the complexity of oriented colouring on restricted digraph classes. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorn\u00fd, J., Rumpe, B. (eds.) SOFSEM 2010. LNCS, vol. 5901, pp. 428\u2013439. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11266-9_36"},{"issue":"1\u20133","key":"14_CR7","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0012-365X(03)00086-4","volume":"274","author":"W Klostermeyer","year":"2004","unstructured":"Klostermeyer, W., MacGillivray, G.: Homomorphisms and oriented colorings of equivalence classes of oriented graphs. Discret. Math. 274(1\u20133), 161\u2013172 (2004). https:\/\/doi.org\/10.1016\/S0012-365X(03)00086-4","journal-title":"Discret. Math."},{"issue":"5","key":"14_CR8","doi-asserted-by":"publisher","first-page":"1489","DOI":"10.1007\/s00373-012-1202-y","volume":"29","author":"TH Marshall","year":"2013","unstructured":"Marshall, T.H.: Homomorphism bounds for oriented planar graphs of given minimum girth. Graphs Comb. 29(5), 1489\u20131499 (2013). https:\/\/doi.org\/10.1007\/s00373-012-1202-y","journal-title":"Graphs Comb."},{"issue":"2","key":"14_CR9","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.ipl.2008.04.007","volume":"108","author":"P Ochem","year":"2008","unstructured":"Ochem, P., Pinlou, A.: Oriented colorings of partial 2-trees. Inf. Proc. Lett. 108(2), 82\u201386 (2008). https:\/\/doi.org\/10.1016\/j.ipl.2008.04.007","journal-title":"Inf. Proc. Lett."},{"issue":"4","key":"14_CR10","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(94)00088-3","volume":"51","author":"A Raspaud","year":"1994","unstructured":"Raspaud, A., Sopena, E.: Good and semi-strong colorings of oriented planar graphs. Inf. Proc. Lett. 51(4), 171\u2013174 (1994). https:\/\/doi.org\/10.1016\/0020-0190(94)00088-3","journal-title":"Inf. Proc. Lett."},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Sopena, \u00c9.: The chromatic number of oriented graphs. J. Graph Theory 25(3), 191\u2013205 (1997). https:\/\/doi.org\/10.1002\/(SICI)1097-0118(199707)25:3<191::AID-JGT3>3.0.CO;2-G","DOI":"10.1002\/(SICI)1097-0118(199707)25:3<191::AID-JGT3>3.0.CO;2-G"},{"issue":"3","key":"14_CR12","doi-asserted-by":"publisher","first-page":"517","DOI":"10.7151\/dmgt.1624","volume":"32","author":"\u00c9 Sopena","year":"2012","unstructured":"Sopena, \u00c9.: Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs. Discuss. Math. Graph Theory 32(3), 517\u2013533 (2012). https:\/\/doi.org\/10.7151\/dmgt.1624","journal-title":"Discuss. Math. Graph Theory"},{"issue":"7","key":"14_CR13","doi-asserted-by":"publisher","first-page":"1993","DOI":"10.1016\/j.disc.2015.03.018","volume":"339","author":"\u00c9 Sopena","year":"2016","unstructured":"Sopena, \u00c9.: Homomorphisms and colourings of oriented graphs: An updated survey. Discret. Math. 339(7), 1993\u20132005 (2016). https:\/\/doi.org\/10.1016\/j.disc.2015.03.018","journal-title":"Discret. Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79987-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:12:02Z","timestamp":1625008322000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79987-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030799861","9783030799878"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79987-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"30 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ottawa, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2021.eecs.uottawa.ca\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"107","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9.1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The workshop was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}