相关论文: Multiple 3-Coloring, an Approach to 4-Coloring of …

Let $G=(V,E)$ be a finite connected graph along with a coloring of the vertices of $G$ using the colors in a given set $X$. In this paper, we introduce multi-color forcing, a generalization of zero-forcing on graphs, and give conditions in…

Irregular computations on unstructured data are an important class of problems for parallel programming. Graph coloring is often an important preprocessing step, e.g. as a way to perform dependency analysis for safe parallel execution. The…

We prove that in any strongly fan-planar drawing of a graph G the edges can be colored with at most three colors, such that no two edges of the same color cross. This implies that the thickness of strongly fan-planar graphs is at most…

A conjecture due to the fourth author states that every $d$-regular planar multigraph can be $d$-edge-coloured, provided that for every odd set $X$ of vertices, there are at least $d$ edges between $X$ and its complement. For $d = 3$ this…

This paper studies the choosability of signed planar graphs. We prove that every signed planar graph is 5-choosable and that there is a signed planar graph which is not 4-choosable while the unsigned graph is 4-choosable. For each $k \in…

DP-coloring (also known as correspondence coloring) is a generalization of list coloring introduced recently by Dvo\v{r}\'ak and Postle (2017). In this paper, we prove that every planar graph $G$ without $4$-cycles adjacent to $k$-cycles is…

A star $k$-coloring is a proper $k$-coloring where the union of two color classes induces a star forest. While every planar graph is 4-colorable, not every planar graph is star 4-colorable. One method to produce a star 4-coloring is to…

The paper considers the NP-hard graph vertex coloring problem, which differs from traditional problems in which it is required to color vertices with a given (or minimal) number of colors so that adjacent vertices have different colors. In…

An interval coloring of a graph G is a proper coloring of E(G) by positive integers such that the colors on the edges incident to any vertex are consecutive. A (3,4)-biregular bigraph is a bipartite graph in which each vertex of one part…

We survey work on coloring, list coloring, and painting squares of graphs; in particular, we consider strong edge-coloring. We focus primarily on planar graphs and other sparse classes of graphs.

Esperet and Joret proved that planar graphs with bounded maximum degree are 3-colorable with bounded clustering. Liu and Wood asked whether the conclusion holds with the assumption of the bounded maximum degree replaced by assuming that no…

A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we confirm the total-coloring conjecture for 1-planar graphs with maximum degree at least 13.

A graph $G$ is $(a,b)$-choosable if for any color list of size $a$ associated with each vertices, one can choose a subset of $b$ colors such that adjacent vertices are colored with disjoint color sets. This paper shows an equivalence…

Montassier, Raspaud, and Wang (2006) asked to find the smallest positive integers $d_0$ and $d_1$ such that planar graphs without $\{4,5\}$-cycles and $d^{\Delta}\ge d_0$ are $3$-choosable and planar graphs without $\{4,5,6\}$-cycles and…

Grotzsch's theorem states that every triangle-free planar graph is 3-colorable. Several relatively simple proofs of this fact were provided by Thomassen and other authors. It is easy to convert these proofs into quadratic-time algorithms to…

This paper discusses reformulations of the problem of coloring plane maps with four colors. We give a number of alternate ways to formulate the coloring problem including a tautological expansion similar to the Penrose Bracket, and an…

It was conjectured by Steinberg in 1976 that planar graphs without cycles of length 4 or 5 are 3-colorable. This conjecture attracted a substantial amount of attention and was finally refuted by Cohen-Addad, Hebdige, Kr\'{a}l', Li and…

DP-coloring (also known as correspondence coloring) is a generalization of list coloring, introduced by Dvo\v{r}\'ak and Postle in 2017. It is well-known that there are non-4-choosable planar graphs. Much attention has recently been put on…

This work studies certain aspects of graphs embedded on surfaces. Initially, a colored graph model for a map of a graph on a surface is developed. Then, a concept analogous to (and extending) planar graph is introduced in the same spirit as…

In this paper, an algorithm for determining 3-colorability, i.e. the decision problem (YES/NO), in planar graphs is presented. The algorithm, although not exact (it could produce false positives) has two very important features: (i) it has…