相关论文: A Note on (3,1)-Choosable Toroidal Graphs

DP-coloring of a simple graph is a generalization of list coloring, and also a generalization of signed coloring of signed graphs. It is known that for each $k \in \{3, 4, 5, 6\}$, every planar graph without $C_k$ is 4-choosable.…

A graph $G=(V,E)$ is total weight $(k,k')$-choosable if the following holds: For any list assignment $L$ which assigns to each vertex $v$ a set $L(v)$ of $k$ real numbers, and assigns to each edge $e$ a set $L(e)$ of $k'$ real numbers,…

A vertex colouring of a graph $G$ is "nonrepetitive" if $G$ contains no path for which the first half of the path is assigned the same sequence of colours as the second half. Thue's famous theorem says that every path is nonrepetitively…

Let $r$ be a positive integer and $G$ be a graph. The list $r$-hued chromatic number of $G$, denoted by $\chi_{L,r}(G)$, is the smallest integer $k$, such that for each $k$-list $L$ of $G$, $G$ has an $(L,r)$-coloring. It is proved in…

For a multi-set $\lambda=\{k_1,k_2, \ldots, k_q\}$ of positive integers, let $k_{\lambda} = \sum_{i=1}^q k_i$. A $\lambda$-list assignment of $G$ is a list assignment $L$ of $G$ such that the colour set $\bigcup_{v \in V(G)}L(v)$ can be…

Let $G$ be a graph on $n$ vertices and let $\mathcal{L}_k$ be an arbitrary function that assigns each vertex in $G$ a list of $k$ colours. Then $G$ is $\mathcal{L}_k$-list colourable if there exists a proper colouring of the vertices of $G$…

The \textit{$r$-dynamic choosability} of a graph $G$, written ${\rm ch}_r(G)$, is the least $k$ such that whenever each vertex is assigned a list of at least $k$ colors a proper coloring can be chosen from the lists so that every vertex $v$…

An edge coloring of a graph $G$ is to color all the edges in the graph such that adjacent edges receive different colors. It is acyclic if each cycle in the graph receives at least three colors. Fiam{\v{c}}ik (1978) and Alon, Sudakov and…

Let $G$ be a connected graph with maximum degree $\Delta$. Brooks' theorem states that $G$ has a $\Delta$-coloring unless $G$ is a complete graph or an odd cycle. A graph $G$ is \emph{degree-choosable} if $G$ can be properly colored from…

For a positive integer $k$, a $k$-colouring of a graph $G=(V,E)$ is a mapping $c: V\rightarrow\{1,2,...,k\}$ such that $c(u)\neq c(v)$ whenever $uv\in E$. The Colouring problem is to decide, for a given $G$ and $k$, whether a $k$-colouring…

For a list assignment $L$ and an $L$-coloring $\varphi$, a Kempe swap in $\varphi$ is \emph{$L$-valid} if it yields another $L$-coloring. Two $L$-colorings are \emph{$L$-equivalent} if we can form one from another by a sequence of $L$-valid…

One of the most famous applications of Graph Theory is in the field of Channel Assignment Problems. There are varieties of graph colouring concepts that are used for different requirements of frequency assignments in communication channels.…

A (vertex) colouring of graph is \emph{acyclic} if it contains no bicoloured cycle. In 1979, Borodin proved that planar graphs are acyclically 5-colourable. In 2010, Kawarabayashi and Mohar proved that locally planar graphs are acyclically…

A proper edge coloring of a graph $G$ with colors $1,2,\dots,t$ is called a \emph{cyclic interval $t$-coloring} if for each vertex $v$ of $G$ the edges incident to $v$ are colored by consecutive colors, under the condition that color $1$ is…

A graph $G = (V,E)$ is word-representable if there is a word $w$ over the alphabet $V$ such that $x$ and $y$ alternate in $w$ if and only if the edge $(x, y)$ is in $G$. It is known [6] that all $3$-colourable graphs are word-representable,…

Chromatic-choosablility is a notion of fundamental importance in list coloring. A graph is chromatic-choosable when its chromatic number is equal to its list chromatic number. In 1990, Kostochka and Sidorenko introduced the list color…

A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors…

In the flexible list coloring problem, we consider a graph $G$ and a color list assignment $L$ on $G$, as well as a subset $U \subseteq V(G)$ for which each $u \in U$ has a preferred color $p(u) \in L(u)$. Our goal is to find a proper…

Let $k, d$ ($2d \leq k)$ be two positive integers. We generalize the well studied notions of $(k,d)$-colorings and of the circular chromatic number $\chi_c$ to signed graphs. This implies a new notion of colorings of signed graphs, and the…

A $(a,b)$-coloring of a graph $G$ associates to each vertex a $b$-subset of a set of $a$ colors in such a way that the color-sets of adjacent vertices are disjoint. We define general reduction tools for $(a,b)$-coloring of graphs for $2\le…