相关论文: On sufficient conditions for planar graphs to be 5…

Recently, Dvo\v{r}\'ak, Norin, and Postle introduced flexibility as an extension of list coloring on graphs [JGT 19']. In this new setting, each vertex $v$ in some subset of $V(G)$ has a request for a certain color $r(v)$ in its list of…

This paper proves the following result: Assume $G$ is a triangle free planar graph, $X$ is an independent set of $G$. If $L$ is a list assignment of $G$ such that $\mid L(v)\mid = 4$ for each vertex $v \in V(G)-X$ and $\mid L(v)\mid = 3$…

For a given $\varepsilon > 0$, we say that a graph $G$ is $\varepsilon$-flexibly $k$-choosable if the following holds: for any assignment $L$ of color lists of size $k$ on $V(G)$, if a preferred color from a list is requested at any set $R$…

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…

For given graph $H$ and graphical property $P$, the conditional chromatic number $\chi(H,P)$ of $H$, is the smallest number $k$, so that $V(H)$ can be decomposed into sets $V_1,V_2,\ldots, V_k$, in which $H[V_i]$ satisfies the property $P$,…

We give a new proof of the fact that every planar graph is 5-choosable, and use it to show that every graph drawn in the plane so that the distance between every pair of crossings is at least 15 is 5-choosable. At the same time we may allow…

It is known that every loopless cubic graph is 4-edge choosable. We prove the following strengthened result. Let G be a planar cubic graph having b cut-edges. There exists a set F of at most 5b/2 edges of G with the following property. For…

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…

We consider the flexible list coloring problem, in which we have a graph $G$, a color list assignment $L:V(G) \rightarrow 2^{\mathbb N}$, and a set $U \subseteq V(G)$ of vertices such that each $u \in U$ has a preferred color $p(u) \in…

This paper proves the following result: If $G$ is a planar graph and $L$ is a $4$-list assignment of $G$ such that $|L(x) \cap L(y)| \le 2$ for every edge $xy$, then $G$ is $L$-colourable. This answers a question asked by Kratochv\'{i}l,…

Thomassen proved that any plane graph of girth 5 is list-colorable from any list assignment such that all vertices have lists of size two or three and the vertices with list of size two are all incident with the outer face and form an…

A graph G is k-choosable if G can be properly colored whenever every vertex has a list of at least k available colors. Thomassen's theorem states that every planar graph is 5-choosable. We extend the result by showing that every graph with…

A list assignment of a graph $G$ is a function $L$ that assigns a list $L(v)$ of colors to each vertex $v\in V(G)$. An $(L,d)^*$-coloring is a mapping $\pi$ that assigns a color $\pi(v)\in L(v)$ to each vertex $v\in V(G)$ so that at most…

A graph $G$ is {\em $k$-choosable} if for every assignment of a set $S(v)$ of $k$ colors to every vertex $v$ of $G$, there is a proper coloring of $G$ that assigns to each vertex $v$ a color from $S(v)$. We consider the complexity of…

A graph is $k$-planar if it can be drawn in the plane so that each edge is crossed at most $k$ times. Typically, the class of 1-planar graphs is among the most investigated graph families within the so-called "beyond planar graphs". A…

An injective coloring of a graph $G$ is an assignment of colors to the vertices of $G$ so that any two vertices with a common neighbor have distinct colors. A graph $G$ is injectively $k$-choosable if for any list assignment $L$, where…

For a graph $G$ with a list assignment $L$ and two $L$-colorings $\alpha$ and $\beta$, an $L$-recoloring sequence from $\alpha$ to $\beta$ is a sequence of proper $L$-colorings where consecutive colorings differ at exactly one vertex. We…

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 show that every planar graph without cycles of length 4 or 5 is…

Thomassen proved that every planar graph $G$ on $n$ vertices has at least $2^{n/9}$ distinct $L$-colorings if $L$ is a 5-list-assignment for $G$ and at least $2^{n/10000}$ distinct $L$-colorings if $L$ is a 3-list-assignment for $G$ and $G$…

A colouring of a graph $G=(V,E)$ is a function $c: V\rightarrow\{1,2,\ldots \}$ such that $c(u)\neq c(v)$ for every $uv\in E$. A $k$-regular list assignment of $G$ is a function $L$ with domain $V$ such that for every $u\in V$, $L(u)$ is a…