{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:02Z","timestamp":1759638182670,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030868376"},{"type":"electronic","value":"9783030868383"}],"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-86838-3_26","type":"book-chapter","created":{"date-parts":[[2021,9,19]],"date-time":"2021-09-19T22:05:30Z","timestamp":1632089130000},"page":"336-348","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Acyclic, Star, and Injective Colouring: Bounding the Diameter"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Brause","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2619-2990","authenticated-orcid":false,"given":"Petr","family":"Golovach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barnaby","family":"Martin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5945-9287","authenticated-orcid":false,"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siani","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,20]]},"reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"R26","DOI":"10.37236\/1779","volume":"11","author":"MO Albertson","year":"2004","unstructured":"Albertson, M.O., Chappell, G.G., Kierstead, H.A., K\u00fcndgen, A., Ramamurthi, R.: Coloring with no 2-colored $${P}_4$$\u2019s. Electron. J. Combinat. 11, R26 (2004)","journal-title":"Electron. J. Combinat."},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"1680","DOI":"10.1016\/j.dam.2012.03.029","volume":"160","author":"M Bodirsky","year":"2012","unstructured":"Bodirsky, M., K\u00e1ra, J., Martin, B.: The complexity of surjective homomorphism problems - a survey. Discrete Appl. Math. 160, 1680\u20131690 (2012)","journal-title":"Discrete Appl. Math."},{"key":"26_CR3","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":"26_CR4","unstructured":"Bok, J., Jedlickov\u00e1, N., Martin, B., Paulusma, D., Smith, S.: Acyclic, star and injective colouring: a complexity picture for $${H}$$-free graphs. In: Proceedings ESA 2020, LIPIcs 173, 22:1\u201322:22 (2020)"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-030-79416-3_2","volume-title":"Computer Science \u2013 Theory and Applications","author":"J Bok","year":"2021","unstructured":"Bok, J., Jedli\u010dkov\u00e1, N., Martin, B., Paulusma, D., Smith, S.: Injective colouring for H-free graphs. In: Santhanam, R., Musatov, D. (eds.) CSR 2021. LNCS, vol. 12730, pp. 18\u201330. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79416-3_2"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.ipl.2017.11.004","volume":"131","author":"M Bonamy","year":"2018","unstructured":"Bonamy, M., Dabrowski, K.K., Feghali, C., Johnson, M., Paulusma, D.: Independent feedback vertex sets for graphs of bounded diameter. Inf. Process. Lett. 131, 26\u201332 (2018)","journal-title":"Inf. Process. Lett."},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Brause, C., Golovach, P.A., Martin, B., Ochem, P., Paulusma D., Smith S.: Acyclic, star and injective colouring: bounding the diameter, Manuscript. arXiv:2104.10593 (2021)","DOI":"10.1007\/978-3-030-86838-3_26"},{"issue":"3","key":"26_CR8","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1016\/j.ejc.2011.12.008","volume":"34","author":"H Broersma","year":"2013","unstructured":"Broersma, H., Fomin, F.V., Golovach, P.A., Paulusma, D.: Three complexity results on coloring $$P_k$$-free graphs. Eur. J. Combinat. 34(3), 609\u2013619 (2013)","journal-title":"Eur. J. Combinat."},{"key":"26_CR9","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":"26_CR10","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0304-3975(86)90184-2","volume":"43","author":"K Edwards","year":"1986","unstructured":"Edwards, K.: The complexity of colouring problems on dense graphs. TCS 43, 337\u2013343 (1986)","journal-title":"TCS"},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"JR Griggs","year":"1992","unstructured":"Griggs, J.R., Yeh, R.K.: Labelling graphs with a condition at distance 2. SIAM J. Discrete Math. 5, 586\u2013595 (1992)","journal-title":"SIAM J. Discrete Math."},{"key":"26_CR12","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. Discrete Math. 256, 179\u2013192 (2002)","journal-title":"Discrete Math."},{"key":"26_CR13","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":"26_CR14","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., Xu, B., Zhang, X.: On the complexity of injective colorings and its generalizations. Theoret. Comput. Sci. 491, 119\u2013126 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"26_CR15","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s00373-017-1864-6","volume":"34","author":"T Karthick","year":"2018","unstructured":"Karthick, T.: Star coloring of certain graph classes. Graphs Combinat. 34, 109\u2013128 (2018)","journal-title":"Graphs Combinat."},{"key":"26_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-030-75242-2_26","volume-title":"Algorithms and Complexity","author":"B Martin","year":"2021","unstructured":"Martin, B., Paulusma, D., Smith, S.: Colouring graphs of bounded diameter in the absence of small cycles. In: Calamoneri, T., Cor\u00f2, F. (eds.) CIAC 2021. LNCS, vol. 12701, pp. 367\u2013380. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75242-2_26"},{"key":"26_CR17","unstructured":"Martin, B., Paulusma, D., Smith, S.: Colouring $${H}$$-free graphs of bounded diameter. In: Proceedings MFCS 2019, LIPIcs 138, 14:1\u201314:14 (2019)"},{"key":"26_CR18","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s00453-014-9949-6","volume":"74","author":"GB Mertzios","year":"2016","unstructured":"Mertzios, G.B., Spirakis, P.G.: Algorithms and almost tight results for 3-Colorability of small diameter graphs. Algorithmica 74, 385\u2013414 (2016)","journal-title":"Algorithmica"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-662-53174-7_2","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"D Paulusma","year":"2016","unstructured":"Paulusma, D.: Open problems on graph coloring for special graph classes. In: Mayr, E.W. (ed.) WG 2015. LNCS, vol. 9224, pp. 16\u201330. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53174-7_2"},{"key":"26_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-39219-2_1","volume-title":"Algorithms and Discrete Applied Mathematics","author":"MA Shalu","year":"2020","unstructured":"Shalu, M.A., Antony, C.: Complexity of restricted variant of star colouring. In: Changat, M., Das, S. (eds.) CALDAM 2020. LNCS, vol. 12016, pp. 3\u201314. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-39219-2_1"},{"key":"26_CR21","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1016\/j.disc.2005.09.016","volume":"306","author":"A Yang","year":"2006","unstructured":"Yang, A., Yuan, J.: Partition the vertices of a graph into one independent set and one acyclic set. Discrete Math. 306, 1207\u20131216 (2006)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86838-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T20:03:22Z","timestamp":1702065802000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86838-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030868376","9783030868383"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86838-3_26","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":"20 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","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":"23 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"47","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2021","order":10,"name":"conference_id","label":"Conference ID","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 and OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","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":"30","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":"11","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 conference was held online due to the COVID-19 pandemic.","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)"}}]}}