相关论文: Edge-coloring 4- and 5-regular projective planar g…

In a (proper) edge-coloring of a bridgeless cubic graph G an edge e is rich (resp. poor) if the number of colors of all edges incident to end-vertices of e is 5 (resp. 3). An edge-coloring of G is is normal if every edge of G is either rich…

Thomassen proved that all planar graphs are $5$-choosable. \v{S}krekovski strengthened the result by showing that all $K_{5}$-minor-free graphs are $5$-choosable. Dvo\v{r}\'{a}k and Postle pointed out that all planar graphs are…

Deciding whether a planar graph (even of maximum degree $4$) is $3$-colorable is NP-complete. Determining subclasses of planar graphs being $3$-colorable has a long history, but since Gr\"{o}tzsch's result that triangle-free planar graphs…

A graph $G$ is $(d_1,d_2,d_3)$-colorable if the vertex set $V(G)$ can be partitioned into three subsets $V_1,V_2$ and $V_3$ such that for $i\in\{1,2,3\}$, the induced graph $G[V_i]$ has maximum vertex-degree at most $d_i$. So,…

This paper proves that every planar graph without cycles of length 4, 7, or 9 is DP-3-colorable.

A generalization of list-coloring, now known as DP-coloring, was recently introduced by Dvo\v{r}\'{a}k and Postle. Essentially, DP-coloring assigns an arbitrary matching between lists of colors at adjacent vertices, as opposed to only…

Listed as No. 53 among the one hundred famous unsolved problems in [J. A. Bondy, U. S. R. Murty, Graph Theory, Springer, Berlin, 2008] is Steinberg's conjecture, which states that every planar graph without 4- and 5-cycles is 3-colorable.…

Let $G(V,E)$ be a $k$-uniform hypergraph. A hyperedge $e \in E$ is said to be properly $(r,p)$ colored by an $r$-coloring of vertices in $V$ if $e$ contains vertices of at least $p$ distinct colors in the $r$-coloring. An $r$-coloring of…

A proper edge coloring of a graph is strong if it creates no bichromatic path of length three. It is well known that for a strong edge coloring of a $k$-regular graph at least $2k-1$ colors are needed. We show that a $k$-regular graph…

In this paper, we continue the study of $2$-colorings in hypergraphs. A hypergraph is $2$-colorable if there is a $2$-coloring of the vertices with no monochromatic hyperedge. It is known (see Thomassen [J. Amer. Math. Soc. 5 (1992),…

The paper deals with an extremal problem concerning equitable colorings of uniform hyper\-graph. Recall that a vertex coloring of a hypergraph $H$ is called proper if there are no monochro-matic edges under this coloring. A hypergraph is…

A celebrated result of Thomassen states that not only can every planar graph be colored properly with five colors, but no matter how arbitrary palettes of five colors are assigned to vertices, one can choose a color from the corresponding…

An edge-coloring of a graph $G$ with colors $1,\ldots,t$ is called an interval $t$-coloring if all colors are used, and the colors of edges incident to any vertex of $G$ are distinct and form an interval of integers. A graph $G$ is interval…

An edge colored graph $G$ is rainbow edge connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph $G$, denoted by $rc(G)$, is the smallest number of colors that are…

Wang and Lih in 2002 conjectured that every planar graph without adjacent triangles is 4-choosable. In this paper, we prove that every planar graph without any 4-cycle adjacent to two triangles is DP-4-colorable, which improves the results…

If $f:\mathbb{N}\rightarrow \mathbb{N}$ is a function, then let us say that $f$ is sublinear if \[\lim_{n\rightarrow +\infty}\frac{f(n)}{n}=0.\] If $G=(V,E)$ is a cubic graph and $c:E\rightarrow \{1,...,k\}$ is a proper $k$-edge-coloring of…

A graph $G=(V,E)$ is a $k$-critical graph if $G$ is not $(k -1)$-colorable but $G-e$ is $(k-1)$-colorable for every $e\in E(G)$. In this paper, we construct a family of 4-critical planar graphs with $n$ vertices and $\frac{7n-13}{3}$ edges.…

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 proper conflict-free coloring of a graph is a proper vertex coloring wherein each non-isolated vertex's open neighborhood contains at least one color appearing exactly once. For a non-negative integer $k$, a graph $G$ is said to be proper…

We prove that every triangle-free $4$-critical graph $G$ satisfies $e(G) \geq \frac{5v(G)+2}{3}$. This result gives a unified proof that triangle-free planar graphs are $3$-colourable, and that graphs of girth at least five which embed in…