{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:54:11Z","timestamp":1743022451700,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031066771"},{"type":"electronic","value":"9783031066788"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-06678-8_32","type":"book-chapter","created":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:03:31Z","timestamp":1653779011000},"page":"439-450","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Relative Clique Number of Triangle-Free Planar Colored Mixed Graphs"],"prefix":"10.1007","author":[{"given":"Soumen","family":"Nandi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sagnik","family":"Sen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Taruni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,29]]},"reference":[{"issue":"1","key":"32_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1008647514949","volume":"8","author":"N Alon","year":"1998","unstructured":"Alon, N., Marshall, T.H.: Homomorphisms of edge-colored graphs and coxeter groups. J. Algebr. Comb. 8(1), 5\u201313 (1998). https:\/\/doi.org\/10.1023\/A:1008647514949","journal-title":"J. Algebr. Comb."},{"issue":"4","key":"32_CR2","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1007\/s00373-017-1807-2","volume":"33","author":"J Bensmail","year":"2017","unstructured":"Bensmail, J., Duffy, C., Sen, S.: Analogues of cliques for (m, n)-colored mixed graphs. Graphs Comb. 33(4), 735\u2013750 (2017)","journal-title":"Graphs Comb."},{"key":"32_CR3","unstructured":"Chakraborty, D., Das, S., Nandi, S., Roy, D., Sen, S.: On clique numbers of colored mixed graphs. Discrete Appl. Math. (2021, accepted)"},{"key":"32_CR4","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.endm.2015.07.017","volume":"50","author":"S Das","year":"2015","unstructured":"Das, S., Mj, S., Sen, S.: On oriented relative clique number. Electron. Notes Discrete Math. 50, 95\u2013101 (2015)","journal-title":"Electron. Notes Discrete Math."},{"issue":"7","key":"32_CR5","doi-asserted-by":"publisher","first-page":"2049","DOI":"10.1016\/j.disc.2018.04.001","volume":"341","author":"S Das","year":"2018","unstructured":"Das, S., Prabhu, S., Sen, S.: A study on oriented relative clique number. Discrete Math. 341(7), 2049\u20132057 (2018)","journal-title":"Discrete Math."},{"key":"32_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-030-39219-2_22","volume-title":"Algorithms and Discrete Applied Mathematics","author":"SS Das","year":"2020","unstructured":"Das, S.S., Nandi, S., Sen, S.: The relative oriented clique number of triangle-free planar graphs is 10. In: Changat, M., Das, S. (eds.) CALDAM 2020. LNCS, vol. 12016, pp. 260\u2013266. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-39219-2_22"},{"issue":"4","key":"32_CR7","first-page":"637","volume":"49","author":"R Fabila-Monroy","year":"2008","unstructured":"Fabila-Monroy, R., Flores, D., Huemer, C., Montejano, A.: Lower bounds for the colored mixed chromatic number of some classes of graphs. Commentationes Mathematicae Universitatis Carolinae 49(4), 637\u2013645 (2008)","journal-title":"Commentationes Mathematicae Universitatis Carolinae"},{"issue":"4","key":"32_CR8","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/j.disc.2012.11.007","volume":"313","author":"S Jendrol","year":"2013","unstructured":"Jendrol, S., Voss, H.-J.: Light subgraphs of graphs embedded in the plane-a survey. Discrete Math. 313(4), 406\u2013421 (2013)","journal-title":"Discrete Math."},{"issue":"1\u20133","key":"32_CR9","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0012-365X(03)00086-4","volume":"274","author":"WF Klostermeyer","year":"2004","unstructured":"Klostermeyer, W.F., MacGillivray, G.: Homomorphisms and oriented colorings of equivalence classes of oriented graphs. Discrete Math. 274(1\u20133), 161\u2013172 (2004)","journal-title":"Discrete Math."},{"key":"32_CR10","series-title":"Trends in Mathematics","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1007\/978-3-030-83823-2_119","volume-title":"Extended Abstracts EuroComb 2021","author":"A Lahiri","year":"2021","unstructured":"Lahiri, A., Nandi, S., Taruni, S., Sen, S.: On chromatic number of (n, m)-graphs. In: Ne\u0161et\u0159il, J., Perarnau, G., Ru\u00e9, J., Serra, O. (eds.) Extended Abstracts EuroComb 2021. TM, vol. 14, pp. 745\u2013751. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-83823-2_119"},{"issue":"12","key":"32_CR11","doi-asserted-by":"publisher","first-page":"1365","DOI":"10.1016\/j.dam.2009.09.017","volume":"158","author":"A Montejano","year":"2010","unstructured":"Montejano, A., Ochem, P., Pinlou, A., Raspaud, A., Sopena, \u00c9.: Homomorphisms of 2-edge-colored graphs. Discrete Appl. Math. 158(12), 1365\u20131379 (2010)","journal-title":"Discrete Appl. Math."},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/j.endm.2009.07.060","volume":"34","author":"A Montejano","year":"2009","unstructured":"Montejano, A., Pinlou, A., Raspaud, A., Sopena, \u00c9.: Chromatic number of sparse colored mixed planar graphs. Electron. Notes Discrete Math. 34, 363\u2013367 (2009)","journal-title":"Electron. Notes Discrete Math."},{"issue":"3","key":"32_CR13","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1002\/jgt.21817","volume":"79","author":"R Naserasr","year":"2015","unstructured":"Naserasr, R., Rollov\u00e1, E., Sopena, \u00c9.: Homomorphisms of signed graphs. J. Graph Theory 79(3), 178\u2013212 (2015)","journal-title":"J. Graph Theory"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Naserasr, R., Sopena, E., Zaslavsky, T.: Homomorphisms of signed graphs: an update. Eur. J. Comb. 91, 103222 (2021)","DOI":"10.1016\/j.ejc.2020.103222"},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"Ne\u0161et\u0159il, J., Raspaud, A.: Colored homomorphisms of colored mixed graphs. J. Comb. Theory Ser. B 80(1), 147\u2013155 (2000)","DOI":"10.1006\/jctb.2000.1977"},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"Ochem, P., Pinlou, A., Sen, S.: Homomorphisms of 2-edge-colored triangle-free planar graphs. J. Graph Theory 85(1), 258\u2013277 (2017)","DOI":"10.1002\/jgt.22059"},{"key":"32_CR17","doi-asserted-by":"crossref","unstructured":"Sopena, E.: The chromatic number of oriented graphs. J. Graph Theory 25(3), 191\u2013205 (1997)","DOI":"10.1002\/(SICI)1097-0118(199707)25:3<191::AID-JGT3>3.0.CO;2-G"},{"key":"32_CR18","doi-asserted-by":"crossref","unstructured":"Sopena, E.: Oriented graph coloring. Discrete Math. 229(1\u20133), 359\u2013369 (2001)","DOI":"10.1016\/S0012-365X(00)00216-8"},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"Sopena, \u00c9.: Homomorphisms and colourings of oriented graphs: an updated survey. Discrete Math. 339(7), 1993\u20132005 (2016)","DOI":"10.1016\/j.disc.2015.03.018"},{"key":"32_CR20","unstructured":"West, D.B.: Introduction to Graph Theory, vol. 2. Prentice Hall, Upper Saddle River (2001)"},{"key":"32_CR21","doi-asserted-by":"crossref","unstructured":"Zaslavsky, T.: Signed graphs. Discrete Appl. Math. 4(1), 47\u201374 (1982)","DOI":"10.1016\/0166-218X(82)90033-6"}],"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-031-06678-8_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:08:18Z","timestamp":1653779298000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06678-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031066771","9783031066788"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06678-8_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 May 2022","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":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.informatik.uni-trier.de\/iwoca-2022","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":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"86","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":"35","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":"41% - 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","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":"10","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)"}}]}}