{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:43:38Z","timestamp":1743061418579,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030752415"},{"type":"electronic","value":"9783030752422"}],"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-75242-2_26","type":"book-chapter","created":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T15:22:29Z","timestamp":1620141749000},"page":"367-380","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Colouring Graphs of Bounded Diameter in the Absence of Small Cycles"],"prefix":"10.1007","author":[{"given":"Barnaby","family":"Martin","sequence":"first","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,5,4]]},"reference":[{"key":"26_CR1","first-page":"1","volume":"187","author":"N Alon","year":"1993","unstructured":"Alon, N.: Restricted colorings of graphs. Surveys in combinatorics, London Mathematical Society Lecture Note Series 187, 1\u201333 (1993)","journal-title":"Surveys in combinatorics, London Mathematical Society Lecture Note Series"},{"issue":"12","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(12), 1680\u20131690 (2012)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"26_CR3","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1007\/s00493-017-3553-8","volume":"38","author":"F Bonomo","year":"2018","unstructured":"Bonomo, F., Chudnovsky, M., Maceli, P., Schaudt, O., Stein, M., Zhong, M.: Three-coloring and list three-coloring of graphs without induced paths on seven vertices. Combinatorica 38(4), 779\u2013801 (2018)","journal-title":"Combinatorica"},{"issue":"3","key":"26_CR4","doi-asserted-by":"crossref","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. Comb. 34(3), 609\u2013619 (2013)","journal-title":"Eur. J. Comb."},{"key":"26_CR5","unstructured":"Chudnovsky, M.: Coloring graphs with forbidden induced subgraphs. In: Proceedings ICM 2014, vol. 4, pp. 291\u2013302 (2014)"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1017\/S0305004100048015","volume":"74","author":"RM Damerell","year":"1973","unstructured":"Damerell, R.M.: On Moore graphs. Proc. Camb. Philos. Soc. 74, 227\u2013236 (1973)","journal-title":"Proc. Camb. Philos. Soc."},{"key":"26_CR7","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. Theoret. Comput. Sci. 43, 337\u2013343 (1986)","journal-title":"Theoret. Comput. Sci."},{"issue":"04","key":"26_CR8","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1017\/S0963548398003678","volume":"7","author":"T Emden-Weinert","year":"1998","unstructured":"Emden-Weinert, T., Hougardy, S., Kreuter, B.: Uniquely colourable graphs and the hardness of colouring graphs of large girth. Comb. Probab. Comput. 7(04), 375\u2013386 (1998)","journal-title":"Comb. Probab. Comput."},{"issue":"4","key":"26_CR9","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 Theor. 84(4), 331\u2013363 (2017)","journal-title":"J. Graph Theor."},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.dam.2013.12.008","volume":"167","author":"PA Golovach","year":"2014","unstructured":"Golovach, P.A., Paulusma, D., Song, J.: Coloring graphs without short cycles and long induced paths. Discrete Appl. Math. 167, 107\u2013120 (2014)","journal-title":"Discrete Appl. Math."},{"key":"26_CR11","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1147\/rd.45.0497","volume":"5","author":"AJ Hoffman","year":"1960","unstructured":"Hoffman, A.J., Singleton, R.R.: On Moore graphs with diameter $$2$$ and $$3$$. IBM J. Res. Devel. 5, 497\u2013504 (1960)","journal-title":"IBM J. Res. Devel."},{"issue":"4","key":"26_CR12","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I Holyer","year":"1981","unstructured":"Holyer, I.: The NP-completeness of edge-coloring. SIAM J. Comput. 10(4), 718\u2013720 (1981)","journal-title":"SIAM J. Comput."},{"key":"26_CR13","volume-title":"Graph Coloring Problems","author":"TR Jensen","year":"1995","unstructured":"Jensen, T.R., Toft, B.: Graph Coloring Problems. Wiley, New York (1995)"},{"key":"26_CR14","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, vol. 123, pp. 5:1\u20135:13 (2018)"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Kratochv\u00edl, J., Tuza, Zs., Voigt, M.: New trends in the theory of graph colorings: choosability and list coloring. In: Proceedings DIMATIA-DIMACS Conference, vol. 49, pp. 183\u2013197 (1999)","DOI":"10.1090\/dimacs\/049\/13"},{"key":"26_CR16","unstructured":"Lov\u00e1sz, L.: Coverings and coloring of hypergraphs. In: Proceedings of 4th Southeastern Conference on Combinatorics, Graph Theory, and Computing, Utilitas Mathematicae, pp. 3\u201312 (1973)"},{"issue":"1","key":"26_CR17","first-page":"61","volume":"2","author":"VV Lozin","year":"2007","unstructured":"Lozin, V.V., Kaminski, M.: Coloring edges and vertices of graphs without short or long cycles. Contrib. Discrete Math. 2(1), 61\u201366 (2007)","journal-title":"Contrib. Discrete Math."},{"key":"26_CR18","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.dam.2015.02.015","volume":"216","author":"VV Lozin","year":"2017","unstructured":"Lozin, V.V., Malyshev, D.S.: Vertex coloring of graphs with few obstructions. Discrete Appl. Math. 216, 273\u2013280 (2017)","journal-title":"Discrete Appl. Math."},{"key":"26_CR19","unstructured":"Martin, B., Paulusma, D., Smith, S.: Colouring $${H}$$-free graphs of bounded diameter. In: Proceedings MFCS 2019, LIPIcs, vol. 138, pp. 14:1\u201314:14 (2019)"},{"issue":"1","key":"26_CR20","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(1), 385\u2013414 (2016)","journal-title":"Algorithmica"},{"key":"26_CR21","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_CR22","doi-asserted-by":"crossref","unstructured":"Pilipczuk, M., Pilipczuk, M., Rz\u0105\u017cewski, P.: Quasi-polynomial-time algorithm for independent set in $${P}_t$$-free and $${C}_{\\ge t}$$-free graphs via shrinking the space of connecting subgraphs. CoRR, abs\/2009.13494 (2020)","DOI":"10.1137\/1.9781611976496.23"},{"issue":"1","key":"26_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-003-0540-1","volume":"20","author":"B Randerath","year":"2004","unstructured":"Randerath, B., Schiermeyer, I.: Vertex colouring and forbidden subgraphs - a survey. Graphs Comb. 20(1), 1\u201340 (2004)","journal-title":"Graphs Comb."},{"key":"26_CR24","unstructured":"Rojas, A., Stein, M.: 3-colouring $${P}_t$$-free graphs without short odd cycles. CoRR, abs\/2008.04845 (2020)"},{"key":"26_CR25","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings STOC, vol. 1978, pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"},{"issue":"2","key":"26_CR26","doi-asserted-by":"publisher","first-page":"161","DOI":"10.7151\/dmgt.1049","volume":"17","author":"Z Tuza","year":"1997","unstructured":"Tuza, Z.: Graph colorings with local constraints - a survey. Discuss. Math. Graph Theory 17(2), 161\u2013228 (1997)","journal-title":"Discuss. Math. Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-75242-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T22:05:12Z","timestamp":1620165912000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75242-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030752415","9783030752422"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75242-2_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":"4 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/easyconferences.eu\/ciac2021\/","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":"78","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":"27","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":"35% - 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)"}},{"value":"Due to the Corona pandemic the conference 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)"}}]}}