相关论文: 55- and 56-configurations are reducible

Let $G$ be an edge-colored graph. A heterochromatic cycle of $G$ is one in which every two edges have different colors. For a vertex $v\in V(G)$, let $CN(v)$ denote the set of colors which are assigned to the edges incident to $v$. In this…

A graph $G$ is called interval colorable if it has a proper edge coloring with colors $1,2,3,\dots$ such that the colors of the edges incident to every vertex of $G$ form an interval of integers. Not all graphs are interval colorable; in…

A graph is $H$-free if it does not contain an induced subgraph isomorphic to $H$. We denote by $P_k$ and $C_k$ the path and the cycle on $k$ vertices, respectively. In this paper, we prove that 4-COLORING is NP-complete for $P_7$-free…

An \emph{acyclic edge-coloring} of a graph $G$ is a proper edge-coloring of $G$ such that the subgraph induced by any two color classes is acyclic. The \emph{acyclic chromatic index}, $\chi'_a(G)$, is the smallest number of colors allowing…

We study graphs with the property that every edge-colouring admits a monochromatic cycle (the length of which may depend freely on the colouring) and describe those graphs that are minimal with this property. We show that every member in…

We consider the problem of clique coloring, that is, coloring the vertices of a given graph such that no (maximal) clique of size at least two is monocolored. It is known that interval graphs are $2$-clique colorable. In this paper we prove…

For nonnegative integers $k, d_1, \ldots, d_k$, a graph is $(d_1, \ldots, d_k)$-colorable if its vertex set can be partitioned into $k$ parts so that the $i$th part induces a graph with maximum degree at most $d_i$ for all $i\in\{1, \ldots,…

In this paper, we consider a number of results and seven conjectures on properly edge-coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prove new ones. In particular, we consider a family of…

Let $G$ be a graph. We introduce the acyclic b-chromatic number of $G$ as an analogue to the b-chromatic number of $G$. An acyclic coloring of a graph $G$ is a map $c:V(G)\rightarrow \{1,\dots,k\}$ such that $c(u)\neq c(v)$ for any $uv\in…

Given a graph or multigraph $G$, let $\chi'_{trans}(G)$ denote the minimum integer $n$ such that any proper $\chi'(G)$--edge coloring of $G$ can be transformed into any other proper $\chi'(G)$--edge coloring of $G$ by a series of…

The $\lambda$-backbone coloring of the graph $G$ with backbone $H$ is a graph-coloring problem in which we are given a graph $G$ and a subgraph $H$, and we want to assign colors to vertices in such a way that the endpoints of every edge…

Given a graph $G$ and a nondecreasing sequence $S=(s_1,\ldots,s_k)$ of positive integers, the mapping $c:V(G)\longrightarrow \{1,\ldots,k\}$ is called an $S$-packing coloring of $G$ if for any two distinct vertices $x$ and $y$ in…

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,…

An edge coloring of a graph $G$ is \emph{woody} if no cycle is monochromatic. The \emph{arboricity} of a graph $G$, denoted by $\arb (G)$, is the least number of colors needed for a woody coloring of $G$. A coloring of $G$ is \emph{strongly…

Proper graph coloring assigns different colors to adjacent vertices of the graph. Usually, the number of colors is fixed or as small as possible. Consider applications (e.g. variants of scheduling) where colors represent limited resources…

Two cycles are {\em adjacent} if they have an edge in common. Suppose that $G$ is a planar graph, for any two adjacent cycles $C_{1}$ and $C_{2}$, we have $|C_{1}| + |C_{2}| \geq 11$, in particular, when $|C_{1}| = 5$, $|C_{2}| \geq 7$. We…

We investigate the extent to which the $k$-coloring graph $\mathcal{C}_{k}(G)$ uniquely determines the base graph $G$ and the number of colors $k$. The vertices of $\mathcal{C}_{k}(G)$ are the proper $k$-colorings of $G$, and edges connect…

A {\it proper conflict-free $c$-coloring} of a graph is a proper $c$-coloring such that each non-isolated vertex has a color appearing exactly once on its neighborhood. This notion was formally introduced by Fabrici et al., who proved that…

Thomassen showed that planar graphs are 5-list-colourable, and that planar graphs of girth at least five are 3-list-colourable. An easy degeneracy argument shows that planar graphs of girth at least four are 4-list-colourable. In 2022,…

An odd graph is a finite graph all of whose vertices have odd degrees. Given graph $G$ is decomposable into $k$ odd subgraphs if its edge set can be partitioned into $k$ subsets each of which induces an odd subgraph of $G$. The minimum…