DVOŘÁK, Zdeněk, Daniel KRÁĽ and Robin THOMAS. Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies. Journal of Combinatorial Theory. Series B. SAN DIEGO: ACADEMIC PRESS INC ELSEVIER SCIENCE, 2021, vol. 150, September 2021, p. 244-269. ISSN 0095-8956. Available from: https://dx.doi.org/10.1016/j.jctb.2020.04.006.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies
Authors DVOŘÁK, Zdeněk, Daniel KRÁĽ (203 Czech Republic, guarantor, belonging to the institution) and Robin THOMAS.
Edition Journal of Combinatorial Theory. Series B, SAN DIEGO, ACADEMIC PRESS INC ELSEVIER SCIENCE, 2021, 0095-8956.
Other information
Original language English
Type of outcome Article in a journal
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Netherlands
Confidentiality degree is not subject to a state or trade secret
WWW URL
Impact factor Impact factor: 1.491
RIV identification code RIV/00216224:14330/21:00124669
Organization unit Faculty of Informatics
Doi http://dx.doi.org/10.1016/j.jctb.2020.04.006
UT WoS 000670294100008
Keywords in English Graph coloring; Planar graphs; Triangle-free graphs; Havel's problem
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 23/5/2022 15:44.
Abstract
We settle a problem of Havel by showing that there exists an absolute constant d such that if G is a planar graph in which every two distinct triangles are at distance at least d, then G is 3-colorable. In fact, we prove a more general theorem. Let G be a planar graph, and let H be a set of connected subgraphs of G, each of bounded size, such that every two distinct members of H are at least a specified distance apart and all triangles of G are contained in boolean OR H. We give a sufficient condition for the existence of a 3-coloring phi of G such that for every H is an element of H the restriction of phi to H is constrained in a specified way. (C) 2020 Elsevier Inc. All rights reserved.
PrintDisplayed: 1/8/2024 12:20