Related papers: Computer assisted discharging procedure on planar …
Inspired by the majority colorings and C-colorings, we introduce and study the majority C-coloring of graphs. In such a vertex coloring, every vertex shares its color with at least half of its neighbors. The maximum number of colors that…
We present two novel six-colorings of the Euclidean plane that avoid monochromatic pairs of points at unit distance in five colors and monochromatic pairs at another specified distance $d$ in the sixth color. Such colorings have previously…
We prove that planar graphs of maximum degree 3 and of girth at least 7 are 3-edge-colorable, extending the previous result for girth at least 8 by Kronk, Radlowski, and Franen from 1974.
In a proper edge-coloring the edges of every color form a matching. A matching is induced if the end-vertices of its edges induce a matching. A strong edge-coloring is an edge-coloring in which the edges of every color form an induced…
We give an upper bound for the online chromatic number of graphs with high girth and for graphs with high oddgirth generalizing Kier- stead's algorithm for graphs that contain neither a C3 or C5 as an induced subgraph.
An injective edge-coloring $c$ of a graph $G$ is an edge-coloring such that if $e_1$, $e_2$, and $e_3$ are three consecutive edges in $G$ (they are consecutive if they form a path or a cycle of length three), then $e_1$ and $e_3$ receive…
A clique-coloring of a graph $G$ is a coloring of the vertices of $G$ so that no maximal clique of size at least two is monochromatic. The clique-hypergraph, $\mathcal{H}(G)$, of a graph $G$ has $V(G)$ as its set of vertices and the maximal…
Consider the graph $\mathbb{H}(d)$ whose vertex set is the hyperbolic plane, where two points are connected with an edge when their distance is equal to some $d>0$. Asking for the chromatic number of this graph is the hyperbolic analogue to…
We show that every edge in a 2-edge-connected planar cubic graph is either contained in a 2-edge-cut or is a chord of some cycle that is contained in a 2-factor of the graph. As a consequence, we show that every edge in a cyclically…
The notion of the circular coloring of signed graphs is a recent one that simultaneously extends both notions of the circular coloring of graphs and $0$-free coloring of signed graphs. A circular $r$-coloring of a signed graph $(G, \sigma)$…
Neumann-Lara (1985) and \v{S}krekovski conjectured that every planar digraph with digirth at least three is 2-colorable. We prove a relaxed version of this conjecture: every planar digraph of digirth at least five is 2-colorable. The result…
For positive integers $\ell$ and $k$, a $(1^\ell, 2^k)$-packing edge-coloring of a graph $G$ is a partition of $E(G)$ into $\ell$ matchings and $k$ induced matchings. A graph is $d$-irregular if it has no adjacent vertices of degree $d$.…
Although it has recently been proved that the packing chromatic number is unbounded on the class of subcubic graphs, there exists subclasses in which the packing chromatic number is finite (and small). These subclasses include subcubic…
The distinguishing chromatic number of a graph $G$ is the smallest number of colors needed to properly color the vertices of $G$ so that the trivial automorphism is the only symmetry of $G$ that preserves the coloring. We investigate the…
A graph $G$ is $k$-critical if $G$ is not $(k-1)$-colorable, but every proper subgraph of $G$ is $(k-1)$-colorable. A graph $G$ is $k$-choosable if $G$ has an $L$-coloring from every list assignment $L$ with $|L(v)|=k$ for all $v$, and a…
The Four color problem is closely related to other branches of mathematics and practical applications. More than 20 of its reformulations are known, which connect this problem with problems of algebra, statistical mechanics and planning.…
The {\em square} of a graph $G$, denoted $G^2$, has the same vertex set as $G$ and an edge between any two vertices at distance at most $2$ in $G$. Wegner (1977) conjectured that for a planar graph $G$, $\chi(G^2) \leq 7$ if $\Delta(G) =…
We show that any planar graph $G=(V,E)$ has a 5-coloring such that one color class contains at most $|V|/6$ vertices. In other words, there exists a partition of $V$ into five independent sets $\{V_1, \cdots, V_5\}$ such that $|V_5| \leq…
The star chromatic index of a multigraph $G$, denoted $\chi'_{s}(G)$, is the minimum number of colors needed to properly color the edges of $G$ such that no path or cycle of length four is bi-colored. A multigraph $G$ is star…
The packing chromatic number $\chi_{\rho}(G)$ of a graph $G$ is the smallest integer $k$ such that there exists a $k$-vertex coloring of $G$ in which any two vertices receiving color $i$ are at distance at least $i+1$. It is proved that in…