{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:42:53Z","timestamp":1787323373176,"version":"build-2736575974"},"reference-count":18,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","funder":[{"DOI":"10.13039\/501100001824","name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","doi-asserted-by":"publisher","award":["14-19503S"],"award-info":[{"award-number":["14-19503S"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1266016"],"award-info":[{"award-number":["DMS-1266016"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1600390"],"award-info":[{"award-number":["DMS-1600390"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>Aksenov proved that in a planar graph $G$ with at most one triangle, every precoloring of a 4-cycle can be extended to a 3-coloring of $G$. We give an exact characterization of planar graphs with two triangles in which some precoloring of a 4-cycle does not extend. We apply this characterization to solve the precoloring extension problem from two 4-cycles in a triangle-free planar graph in the case that the precolored 4-cycles are separated by many disjoint 4-cycles. The latter result is used in follow-up papers [ SIAM J. Discrete Math., 31 (2017), pp. 865--874; SIAM J. Discrete Math., 32 (2018), pp. 94--105] to give detailed information about the structure of 4-critical triangle-free graphs embedded in a fixed surface.<\/jats:p>","DOI":"10.1137\/15m1023385","type":"journal-article","created":{"date-parts":[[2018,7,24]],"date-time":"2018-07-24T12:51:52Z","timestamp":1532436712000},"page":"1775-1805","source":"Crossref","is-referenced-by-count":0,"title":["Fine Structure of 4-Critical Triangle-Free Graphs I. Planar Graphs with Two Triangles and 3-Colorability of Chains"],"prefix":"10.1137","volume":"32","author":[{"given":"Zden\u011bk","family":"Dvo\u0159\u00e1k","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8612-3594","authenticated-orcid":true,"given":"Bernard","family":"Lidick\u00fd","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2018,7,24]]},"reference":[{"key":"atypb1","first-page":"117","volume":"1","author":"Aksenov V. A.","year":"2004","journal-title":"Sib. E\u0300lektron. Mat. Izv."},{"key":"atypb2","first-page":"3","volume":"26","author":"Aksenov V. A.","year":"1974","journal-title":"Diskret. Anal. Novosibirsk"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2014.03.009"},{"key":"atypb4","unstructured":"Z. Dvor\u030ca\u0301k, D. Kra\u0301l', and R. Thomas,\n                      Three-Coloring Triangle-Free Graphs on Surfaces VI. 3-Colorability of Quadrangulations\n                      , preprint,arXiv:1509.01013, 2015."},{"key":"atypb5","unstructured":"Z. Dvor\u030ca\u0301k, D. Kra\u0301l', and R. Thomas,\n                      Three-Coloring Triangle-Free Graphs on Surfaces V. Coloring Planar Graphs with Distant Anomalies\n                      , preprint,https:\/\/arxiv.org\/abs\/0911.0885v3, 2016."},{"key":"atypb6","unstructured":"Z. Dvor\u030ca\u0301k, D. Kra\u0301l', and R. Thomas,\n                      Three-Coloring Triangle-Free Graphs on Surfaces \\textupVII. A Linear-Time Algorithm\n                      , preprint,https:\/\/arxiv.org\/abs\/1601.01197, 2016."},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.21842"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1137\/130920952"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1137\/15M1023397"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1137\/15M1023403"},{"key":"atypb11","unstructured":"M. Garey and D. Johnson,\n                      Computers and Intractability: A Guide to the Theory of NP-Completeness\n                      , WH Freeman, New York, 1979."},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-97-01926-0"},{"key":"atypb13","first-page":"109","volume":"8","author":"Gro\u0308tzsch H.","year":"1959","journal-title":"Math.-Natur. Reihe"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1307\/mmj\/1028998916"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(69)80054-2"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-014-3020-x"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2004.05.001"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1994.1069"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/15M1023385","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:58:43Z","timestamp":1787320723000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/15M1023385"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1137\/15M1023385"],"URL":"https:\/\/doi.org\/10.1137\/15m1023385","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}