{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:29Z","timestamp":1740107129026,"version":"3.37.3"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,11,6]],"date-time":"2024-11-06T00:00:00Z","timestamp":1730851200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,6]],"date-time":"2024-11-06T00:00:00Z","timestamp":1730851200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100009935","name":"Indo-French Centre for Applied Mathematics","doi-asserted-by":"publisher","award":["MA\/IFCAM\/18\/39"],"award-info":[{"award-number":["MA\/IFCAM\/18\/39"]}],"id":[{"id":"10.13039\/100009935","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"crossref","award":["MTR\/2021\/000858"],"award-info":[{"award-number":["MTR\/2021\/000858"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s00373-024-02851-z","type":"journal-article","created":{"date-parts":[[2024,11,6]],"date-time":"2024-11-06T21:17:13Z","timestamp":1730927833000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Coloring Parameters of Triangle-Free Planar (n,\u00a0m)-Graphs"],"prefix":"10.1007","volume":"40","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":[[2024,11,6]]},"reference":[{"issue":"1","key":"2851_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)","journal-title":"J. Algebr. Comb."},{"issue":"1","key":"2851_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2020.112151","volume":"344","author":"J Bensmail","year":"2021","unstructured":"Bensmail, J., Das, S., Nandi, S., Paul, S., Pierron, T., Sen, S., Sopena, E.: Pushable chromatic number of graphs with degree constraints. Discr. Math. 344(1), 112151 (2021)","journal-title":"Discr. Math."},{"issue":"2","key":"2851_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2021.112664","volume":"345","author":"J Bensmail","year":"2022","unstructured":"Bensmail, J., Das, S., Nandi, S., Pierron, T., Sen, S., Sopena, E.: On the signed chromatic number of some classes of graphs. Discr. Math. 345(2), 112664 (2022)","journal-title":"Discr. Math."},{"issue":"4","key":"2851_CR4","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."},{"issue":"3","key":"2851_CR5","first-page":"31","volume":"17","author":"J Bensmail","year":"2016","unstructured":"Bensmail, J., Duvignau, R., Kirgizov, S.: The complexity of deciding whether a graph admits an orientation with fixed weak diameter. Discr. Math. Theor. Comput. Sci. 17(3), 31\u201342 (2016)","journal-title":"Discr. Math. Theor. Comput. Sci."},{"issue":"1","key":"2851_CR6","first-page":"117","volume":"77","author":"J Bensmail","year":"2020","unstructured":"Bensmail, J., Nandi, S., Roy, M., Sen, S.: Classification of edge-critical underlying absolute planar cliques for signed graphs. Austral. J. Comb. 77(1), 117\u2013135 (2020)","journal-title":"Austral. J. Comb."},{"key":"2851_CR7","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.dam.2017.07.037","volume":"232","author":"J Bensmail","year":"2017","unstructured":"Bensmail, J., Nandi, S., Sen, S.: On oriented cliques with respect to push operation. Discr. Appl. Math. 232, 50\u201363 (2017)","journal-title":"Discr. Appl. Math."},{"issue":"1","key":"2851_CR8","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1006\/jctb.2000.1984","volume":"81","author":"OV Borodin","year":"2001","unstructured":"Borodin, O.V., Fon-Der-Flaass, D., Kostochka, A.V., Raspaud, A., Sopena, E.: On deeply critical oriented graphs. J. Comb. Theory Ser. B 81(1), 150\u2013155 (2001)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2851_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.dam.2022.08.013","volume":"324","author":"D Chakraborty","year":"2023","unstructured":"Chakraborty, D., Das, S., Nandi, S., Roy, D., Sen, S.: On clique numbers of colored mixed graphs. Discr. Appl. Math. 324, 29\u201340 (2023)","journal-title":"Discr. Appl. Math."},{"key":"2851_CR10","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.dam.2018.03.005","volume":"280","author":"S Das","year":"2020","unstructured":"Das, S., Ghosh, P., Prabhu, S., Sen, S.: Relative clique number of planar signed graphs. Discr. Appl. Math. 280, 86\u201392 (2020)","journal-title":"Discr. Appl. Math."},{"key":"2851_CR11","doi-asserted-by":"crossref","unstructured":"Das, S., Nandi, S., Sen, S., Seth, R.: The relative signed clique number of planar graphs is 8. In: Algorithms and Discrete Applied Mathematics: 5th International Conference, CALDAM 2019, Kharagpur, India, February 14\u201316, 2019, Proceedings, pp. 245\u2013253. Springer (2019)","DOI":"10.1007\/978-3-030-11509-8_20"},{"issue":"7","key":"2851_CR12","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. Discr. Math. 341(7), 2049\u20132057 (2018)","journal-title":"Discr. Math."},{"key":"2851_CR13","doi-asserted-by":"crossref","unstructured":"Das, S.S., Nandi, S., Sen, S.: The relative oriented clique number of triangle-free planar graphs is 10. In: Conference on Algorithms and Discrete Applied Mathematics, pp. 260\u2013266. Springer, Berlin (2020)","DOI":"10.1007\/978-3-030-39219-2_22"},{"key":"2851_CR14","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.22953","author":"C Duffy","year":"2023","unstructured":"Duffy, C., Pavan, P.D., Sandeep, R.B., Sen, S.: On deeply critical oriented cliques. J. Graph Theory (2023). https:\/\/doi.org\/10.1002\/jgt.22953","journal-title":"J. Graph Theory"},{"issue":"5","key":"2851_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2020.111829","volume":"343","author":"J Dybizba\u0144ski","year":"2020","unstructured":"Dybizba\u0144ski, J., Ochem, P., Pinlou, A., Szepietowski, A.: Oriented cliques and colorings of graphs with low maximum degree. Discr. Math. 343(5), 111829 (2020)","journal-title":"Discr. Math."},{"key":"2851_CR16","first-page":"215","volume":"1","author":"P Erdos","year":"1966","unstructured":"Erdos, P., R\u00e9nyi, A., S\u00f3s, V.T.: On a problem of graphs theory. Stud. Sci. Math Hungr. 1, 215\u2013235 (1966)","journal-title":"Stud. Sci. Math Hungr."},{"issue":"4","key":"2851_CR17","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. Comment. Math. Univ. Carolina 49(4), 637\u2013645 (2008)","journal-title":"Comment. Math. Univ. Carolina"},{"issue":"4","key":"2851_CR18","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/PL00021182","volume":"14","author":"Z F\u00fcredi","year":"1998","unstructured":"F\u00fcredi, Z., Horak, P., Pareek, C.M., Zhu, X.: Minimal oriented graphs of diameter 2. Graphs Comb. 14(4), 345\u2013350 (1998)","journal-title":"Graphs Comb."},{"issue":"4","key":"2851_CR19","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\u00e2\u20aca survey. Discr. Math. 313(4), 406\u2013421 (2013)","journal-title":"Discr. Math."},{"key":"2851_CR20","first-page":"23","volume":"2","author":"G Katona","year":"1967","unstructured":"Katona, G., Szemer\u00e9di, E.: On a problem of graph theory. Stud. Sci. Math. Hung. 2, 23\u201328 (1967)","journal-title":"Stud. Sci. Math. Hung."},{"issue":"3","key":"2851_CR21","doi-asserted-by":"publisher","first-page":"373","DOI":"10.7151\/dmgt.1237","volume":"24","author":"WF Klostermeyer","year":"2004","unstructured":"Klostermeyer, W.F., MacGillivray, G.: Analogues of cliques for oriented coloring. Discuss. Math. Graph Theory 24(3), 373\u2013387 (2004)","journal-title":"Discuss. Math. Graph Theory"},{"issue":"1\u20133","key":"2851_CR22","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. Discr. Math. 274(1\u20133), 161\u2013172 (2004)","journal-title":"Discr. Math."},{"key":"2851_CR23","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1090\/dimacs\/049\/12","volume":"49","author":"AV Kostochka","year":"1999","unstructured":"Kostochka, A.V., Luczak, T., Simonyi, G., Sopena, E.: On the minimum number of edges giving maximum oriented chromatic number. DIMACS Ser. Discr. Math. Theor. Comput. Sci. 49, 179\u2013182 (1999)","journal-title":"DIMACS Ser. Discr. Math. Theor. Comput. Sci."},{"key":"2851_CR24","doi-asserted-by":"crossref","unstructured":"Lahiri, A., Nandi, S., Sen, S., Taruni, S.: On chromatic number of $$(n,m)$$-graphs. In: Extended Abstracts EuroComb 2021, pp. 745\u2013751 (2021)","DOI":"10.1007\/978-3-030-83823-2_119"},{"issue":"3","key":"2851_CR25","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1002\/jgt.20233","volume":"55","author":"TH Marshall","year":"2007","unstructured":"Marshall, T.H.: Homomorphism bounds for oriented planar graphs. J. Graph Theory 55(3), 175\u2013190 (2007)","journal-title":"J. Graph Theory"},{"key":"2851_CR26","first-page":"223","volume":"120","author":"TH Marshall","year":"2015","unstructured":"Marshall, T.H.: On oriented graphs with certain extension properties. ARS Combin. 120, 223\u2013236 (2015)","journal-title":"ARS Combin."},{"issue":"12","key":"2851_CR27","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, E.: Homomorphisms of 2-edge-colored graphs. Discr. Appl. Math. 158(12), 1365\u20131379 (2010)","journal-title":"Discr. Appl. Math."},{"key":"2851_CR28","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, E.: Chromatic number of sparse colored mixed planar graphs. Electron. Discr. Math. 34, 363\u2013367 (2009)","journal-title":"Electron. Discr. Math."},{"issue":"2","key":"2851_CR29","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1002\/jgt.21893","volume":"82","author":"A Nandy","year":"2016","unstructured":"Nandy, A., Sen, S., Sopena, E.: Outerplanar and planar oriented cliques. J. Graph Theory 82(2), 165\u2013193 (2016)","journal-title":"J. Graph Theory"},{"key":"2851_CR30","doi-asserted-by":"crossref","unstructured":"Nandi, S., Sen, S., Taruni, S.: On relative clique number of triangle-free planar colored mixed graphs. In: International Workshop on Combinatorial Algorithms, pp. 439\u2013450. Springer (2022)","DOI":"10.1007\/978-3-031-06678-8_32"},{"issue":"3","key":"2851_CR31","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, E.: Homomorphisms of signed graphs. J. Graph Theory 79(3), 178\u2013212 (2015)","journal-title":"J. Graph Theory"},{"key":"2851_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2020.103222","volume":"91","author":"R Naserasr","year":"2021","unstructured":"Naserasr, R., Sopena, E., Zaslavsky, T.: Homomorphisms of signed graphs: an update. Eur. J. Comb. 91, 103222 (2021)","journal-title":"Eur. J. Comb."},{"issue":"1","key":"2851_CR33","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1006\/jctb.2000.1977","volume":"80","author":"J Ne\u0161et\u0159il","year":"2000","unstructured":"Ne\u0161et\u0159il, J., Raspaud, A.: Colored homomorphisms of colored mixed graphs. J. Comb. Theory Ser. B 80(1), 147\u2013155 (2000)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"2851_CR34","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.ipl.2004.06.012","volume":"92","author":"P Ochem","year":"2004","unstructured":"Ochem, P.: Oriented colorings of triangle-free planar graphs. Inf. Process. Lett. 92(2), 71\u201376 (2004)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"2851_CR35","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1002\/jgt.22059","volume":"85","author":"P Ochem","year":"2017","unstructured":"Ochem, P., Pinlou, A., Sen, S.: Homomorphisms of 2-edge-colored triangle-free planar graphs. J. Graph Theory 85(1), 258\u2013277 (2017)","journal-title":"J. Graph Theory"},{"issue":"3","key":"2851_CR36","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1002\/(SICI)1097-0118(199707)25:3<191::AID-JGT3>3.0.CO;2-G","volume":"25","author":"E Sopena","year":"1997","unstructured":"Sopena, E.: The chromatic number of oriented graphs. J. Graph Theory 25(3), 191\u2013205 (1997)","journal-title":"J. Graph Theory"},{"issue":"1\u20133","key":"2851_CR37","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/S0012-365X(00)00216-8","volume":"229","author":"E Sopena","year":"2001","unstructured":"Sopena, E.: Oriented graph coloring. Discr. Math. 229(1\u20133), 359\u2013369 (2001)","journal-title":"Discr. Math."},{"issue":"7","key":"2851_CR38","doi-asserted-by":"publisher","first-page":"1993","DOI":"10.1016\/j.disc.2015.03.018","volume":"339","author":"E Sopena","year":"2016","unstructured":"Sopena, E.: Homomorphisms and colourings of oriented graphs: an updated survey. Discr. Math. 339(7), 1993\u20132005 (2016)","journal-title":"Discr. Math."},{"key":"2851_CR39","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory, vol. 2. Prentice Hall, Upper Saddle River (2001)"},{"issue":"1","key":"2851_CR40","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0166-218X(82)90033-6","volume":"4","author":"T Zaslavsky","year":"1982","unstructured":"Zaslavsky, T.: Signed graphs. Discret. Appl. Math. 4(1), 47\u201374 (1982)","journal-title":"Discret. Appl. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02851-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-024-02851-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02851-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T20:07:14Z","timestamp":1733515634000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-024-02851-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,6]]},"references-count":40,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["2851"],"URL":"https:\/\/doi.org\/10.1007\/s00373-024-02851-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2024,11,6]]},"assertion":[{"value":"11 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interests"}}],"article-number":"117"}}