相关论文: Bounds for the game coloring number of planar grap…

We denote by $\chi$ g (G) the game chromatic number of a graph G, which is the smallest number of colors Alice needs to win the coloring game on G. We know from Montassier et al. [M. Montassier, P. Ossona de Mendez, A. Raspaud and X. Zhu,…

A strong $k$-edge-coloring of a graph $G$ is a mapping from $E(G)$ to $\{1,2,\ldots,k\}$ such that every pair of distinct edges at distance at most two receive different colors. The strong chromatic index $\chi'_s(G)$ of a graph $G$ is the…

A strong edge coloring of a graph is a proper edge coloring where the edges at distance at most two receive distinct colors. It is known that every planar graph with maximum degree D has a strong edge coloring with at most 4D + 4 colors. We…

A strong edge coloring of a graph is a proper edge coloring in which every color class is an induced matching. The strong chromatic index $\chi_s'(G)$ of a graph $G$ is the minimum number of colors in a strong edge coloring of $G$. Let…

A \textit{star $k$-coloring} of a graph $G$ is a proper (vertex) $k$-coloring of $G$ such that the vertices on a path of length three receive at least three colors. Given a graph $G$, its \textit{star chromatic number}, denoted $\chi_s(G)$,…

A strong edge-colouring of a graph is a proper edge-colouring where each colour class induces a matching. It is known that every planar graph with maximum degree $\Delta$ has a strong edge-colouring with at most $4\Delta+4$ colours. We show…

A {\em conflict-free coloring} of a graph {\em with respect to open} (resp., {\em closed}) {\em neighborhood} is a coloring of vertices such that for every vertex there is a color appearing exactly once in its open (resp., closed)…

We consider the graph coloring game, a game in which two players take turns properly coloring the vertices of a graph, with one player attempting to complete a proper coloring, and the other player attempting to prevent a proper coloring.…

A vertex coloring of a graph $G$ is said to be a 2-distance coloring if any two vertices at distance at most $2$ from each other receive different colors, and the least number of colors for which $G$ admits a $2$-distance coloring is known…

The weak $r$-coloring numbers $wcol_r(G)$ of a graph $G$ were introduced by the first two authors as a generalization of the usual coloring number $col(G)$, and have since found interesting theoretical and algorithmic applications. This has…

A graph G is (a:b)-colorable if there exists an assignment of b-element subsets of {1,...,a} to vertices of G such that sets assigned to adjacent vertices are disjoint. We first show that for every triangle-free planar graph G and a vertex…

A vertex coloring $\phi$ of a graph $G$ is $p$-centered if for every connected subgraph $H$ of $G$ either $\phi$ uses more than $p$ colors on $H$ or there is a color that appears exactly once on $H$. Centered colorings form one of the…

A coloring of a graph is an assignment of colors to its vertices such that adjacent vertices have different colors. Two colorings are equivalent if they induce the same partition of the vertex set into color classes. Let $\mathcal{A}(G)$ be…

A vertex coloring of a graph $G$ is called a 2-distance coloring if any two vertices at a distance at most $2$ from each other receive different colors. Suppose that $G$ is a planar graph with girth $5$ and maximum degree $\Delta$. We prove…

The strong chromatic index of a graph $G$, denoted $\chi_s'(G)$, is the least number of colors needed to edge-color $G$ so that edges at distance at most two receive distinct colors. The strong list chromatic index, denoted…

A coloring of a graph $G=(V,E)$ is a partition $\{V_1, V_2, \ldots, V_k\}$ of $V$ into independent sets or color classes. A vertex $v\in V_i$ is a Grundy vertex if it is adjacent to at least one vertex in each color class $V_j$ for every…

A {\em strong edge coloring} of a graph is a proper edge coloring in which every color class is an induced matching. The {\em strong chromatic index} of a graph is the minimum number of colors needed to obtain a strong edge coloring. In an…

The online list coloring game is a two-player graph-coloring game played on a graph $G$ as follows. On each turn, a Lister reveals a new color $c$ at some subset $S \subseteq V(G)$ of uncolored vertices, and then a Painter chooses an…

A graph is $(d_1, ..., d_r)$-colorable if its vertex set can be partitioned into $r$ sets $V_1, ..., V_r$ so that the maximum degree of the graph induced by $V_i$ is at most $d_i$ for each $i\in \{1, ..., r\}$. For a given pair $(g, d_1)$,…

The famous Wegner's Planar Graph Conjecture asserts tight upper bounds on the chromatic number of the square $G^2$ of a planar graph $G$, depending on the maximum degree $\Delta(G)$ of $G$. The only case that the conjecture is resolved is…