Precoloring 3-extension on outerplanar graphs

Abstract

The precoloring problem of a graph involves assigning colors to some vertices beforehand, and the objective is to determine whether it can be extended to a proper k-coloring of the entire graph. In 1958, Grotzsch proved that every triangle-free planar graph can be properly colored by three colors. One of the further generalizations of it is the recent result by Hoang La et al. in (Discrete Mathematics, 345(6) (2022), 112849 ). They proved that any two non-adjacent vertices and a face with a length at most four are precolored, the precolorings can be extended to a 3-coloring of the graph. In the paper, we consider precoloring extension of connected outerplanar graph with at most one or two triangles. Particularly, we show that precoloring of any two or three non-adjacent vertices can be extend to a 3-coloring of the whole graph.

Figures (12)

• Figure 1: The graph of $K_4^{'}$.
• Figure 2: The structure of "$diamond\ D$".
• Figure 3: A mapping function $f$ satisfies $f(a) = x$, $f(b) = y$, $f(c) = z$, $f(d) = y$, $f(e) = z$, such that graphs $G$ and $G'$ are homomorphic.
• Figure 4:
• Figure 5:

Theorems & Definitions (23)

• Theorem 1.1: LaLuSt
• Theorem 1.2: LaLuSt
• Theorem 1.3: LaLuSt
• Theorem 1.4: Aksionov1974BrankoGrunbaum1963
• Theorem 1.5
• Theorem 1.6
• Corollary 1.7
• Corollary 1.8
• Theorem 3.1
• proof