{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T03:49:37Z","timestamp":1752983377927,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030794156"},{"type":"electronic","value":"9783030794163"}],"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-79416-3_2","type":"book-chapter","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T18:03:46Z","timestamp":1623866626000},"page":"18-30","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Injective Colouring for H-Free Graphs"],"prefix":"10.1007","author":[{"given":"Jan","family":"Bok","sequence":"first","affiliation":[]},{"given":"Nikola","family":"Jedli\u010dkov\u00e1","sequence":"additional","affiliation":[]},{"given":"Barnaby","family":"Martin","sequence":"additional","affiliation":[]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[]},{"given":"Siani","family":"Smith","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,17]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1093\/comjnl\/47.2.193","volume":"47","author":"HL Bodlaender","year":"2004","unstructured":"Bodlaender, H.L., Kloks, T., Tan, R.B., van Leeuwen, J.: Approximations for lambda-colorings of graphs. Comput. J. 47, 193\u2013204 (2004)","journal-title":"Comput. J."},{"key":"2_CR2","unstructured":"Bok, J., Jedlic\u0306kov\u00e1, N., Martin, B., Paulusma, D., Smith, S.: Acyclic colouring, star colouring and injective colouring for $${H}$$-free graphs. In: Proceedings ESA 2020, LIPIcs, vol. 173, pp. 22:1\u201322:22 (2020)"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"1344","DOI":"10.1093\/comjnl\/bxr037","volume":"54","author":"T Calamoneri","year":"2011","unstructured":"Calamoneri, T.: The $${L}(h, k)$$-labelling problem: an updated survey and annotated bibliography. Comput. J. 54, 1344\u20131371 (2011)","journal-title":"Comput. J."},{"key":"2_CR4","unstructured":"Chudnovsky, M., Huang, S., Spirkl, S., Zhong, M.: List-three-coloring graphs with no induced $${P}_6+r{P}_3$$. CoRR, abs\/1806.11196 (2018)"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1002\/jgt.22028","volume":"84","author":"PA Golovach","year":"2017","unstructured":"Golovach, P.A., Johnson, M., Paulusma, D., Song, J.: A survey on the computational complexity of colouring graphs with forbidden subgraphs. J. Graph Theory 84, 331\u2013363 (2017)","journal-title":"J. Graph Theory"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0012-365X(01)00466-6","volume":"256","author":"G Hahn","year":"2002","unstructured":"Hahn, G., Kratochv\u00edl, J., \u0160ir\u00e1\u0148, J., Sotteau, D.: On the injective chromatic number of graphs. Discret. Math. 256, 179\u2013192 (2002)","journal-title":"Discret. Math."},{"key":"2_CR7","unstructured":"Heggernes, P., Telle, J.A.: Partitioning graphs into generalized dominating sets. Nordic J. Comput. 5, 128\u2013142 (1998)"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-540-78773-0_45","volume-title":"LATIN 2008: Theoretical Informatics","author":"P Hell","year":"2008","unstructured":"Hell, P., Raspaud, A., Stacho, J.: On injective colourings of chordal graphs. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 520\u2013530. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78773-0_45"},{"key":"2_CR9","unstructured":"Jansen, K.: Complexity Results for the Optimum Cost Chromatic Partition Problem, Universit\u00e4t Trier, Mathematik\/Informatik, Forschungsbericht, pp. 96\u201341 (1996)"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.tcs.2013.04.026","volume":"491","author":"J Jin","year":"2013","unstructured":"Jin, J., Baogang, X., Zhang, X.: On the complexity of injective colorings and its generalizations. Theoret. Comput. Sci. 491, 119\u2013126 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR11","unstructured":"Klimo\u0161ov\u00e1, T., Mal\u00edk, J., Masa\u0159\u00edk, T., Novotn\u00e1, J., Paulusma, D., Sl\u00edvov\u00e1, V.: Colouring $$({P}_r+{P}_s)$$-free graphs. In: Proceedings ISAAC 2018, LIPIcs, pp. 123:5:1\u20135:13 (2018)"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/3-540-45477-2_23","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"D Kr\u00e1l\u2019","year":"2001","unstructured":"Kr\u00e1l\u2019, D., Kratochv\u00edl, J., Tuza, Z., Woeginger, G.J.: Complexity of coloring graphs without forbidden induced subgraphs. In: Brandst\u00e4dt, A., Le, V.B. (eds.) WG 2001. LNCS, vol. 2204, pp. 254\u2013262. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45477-2_23"},{"key":"2_CR13","first-page":"71","volume":"1992","author":"EL Lloyd","year":"1992","unstructured":"Lloyd, E.L., Ramanathan, S.: On the complexity of distance-$$2$$ coloring. Proc. ICCI 1992, 71\u201374 (1992)","journal-title":"Proc. ICCI"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0166-218X(01)00237-2","volume":"118","author":"M Mahdian","year":"2002","unstructured":"Mahdian, M.: On the computational complexity of strong edge coloring. Discret. Appl. Math. 118, 239\u2013248 (2002)","journal-title":"Discret. Appl. Math."},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1023\/A:1019128411323","volume":"3","author":"A Sen","year":"1997","unstructured":"Sen, A., Huson, M.L.: A new model for scheduling packet radio networks. Wireless Netw. 3, 71\u201382 (1997)","journal-title":"Wireless Netw."},{"key":"2_CR16","unstructured":"Zhou, X., Kanari, Y., Nishizeki, T.: Generalized vertex-coloring of partial $$k$$-trees. IEICE Trans. Fundamentals Electron. Commun. Comput. Sci. E83-A, 671\u2013678 (2000)"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79416-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T23:19:34Z","timestamp":1623971974000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79416-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030794156","9783030794163"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79416-3_2","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":"17 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sochi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","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":"28 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2021\/","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":"68","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":"28","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.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.2","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)"}}]}}