相关论文: Morphism extension classes of countable $L$-colore…

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 majority edge-coloring of a graph without pendant edges is a coloring of its edges such that, for every vertex $v$ and every color $\alpha$, there are at most as many edges incident to $v$ colored with $\alpha$ as with all other colors.…

Let $F$ be a (possibly improper) edge-coloring of a graph $G$; a vertex coloring of $G$ is \emph{adapted to} $F$ if no color appears at the same time on an edge and on its two endpoints. If for some integer $k$, a graph $G$ is such that…

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 graphs $G$ and $H$, a homomorphism from $G$ to $H$, or $H$-coloring of $G$, is a map from the vertices of $G$ to the vertices of $H$ that preserves adjacency. When $H$ is composed of an edge with one looped endvertex, an $H$-coloring of…

It is proved that in Godel's constructible universe, for every infinite successor cardinal k, there exist graphs G and H of size and chromatic number k, for which the tensor product graph (G x H) is countably chromatic.

This paper studies edge-precoloring extensions in Cartesian products of graphs, motivated by a conjecture of Casselgren, Petros, and Fufa. We formulate a general hypothesis stating that if every edge-precoloring of $G$ and $H$ of sizes…

Two graphs are homomorphism indistinguishable over a graph class $\mathcal{F}$, denoted by $G \equiv_{\mathcal{F}} H$, if $\operatorname{hom}(F,G) = \operatorname{hom}(F,H)$ for all $F \in \mathcal{F}$ where $\operatorname{hom}(F,G)$…

We show that, given an infinite cardinal $\mu$, a graph has colouring number at most $\mu$ if and only if it contains neither of two types of subgraph. We also show that every graph with infinite colouring number has a well-ordering of its…

For a number $\ell\geq 2$, let $\mathcal{H}_{\ell}$ denote the family of graphs which have girth $2\ell$ and have no even hole with length greater than $2\ell$. Wu, Xu, and Xu conjectured that every graph in…

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…

A $k$-uniform hypergraph (or $k$-graph) $H = (V, E)$ is $k$-partite if $V$ can be partitioned into $k$ sets $V_1, \ldots, V_k$ such that each edge in $E$ contains precisely one vertex from each $V_i$. In this note, we consider list…

Let $X$ be a connected, locally finite graph with symmetric growth. We prove that there is a vertex coloring $\phi\colon X\to\{0,1\}$ and some $R\in\mathbb{N}$ such that every automorphism $f$ preserving $\phi$ is $R$-close to the identity…

In [J. Combin. Theory Ser. B 161 (2023), 109--119], the authors showed that the list-color function $P_l(G,k)$ of any simple graph $G$ of size $m$ coincides with its chromatic polynomial $P(G,k)$ for all integers $k\ge m-1$. In this…

Subgraph and homomorphism counting are fundamental algorithmic problems. Given a constant-sized pattern graph $H$ and a large input graph $G$, we wish to count the number of $H$-homomorphisms/subgraphs in $G$. Given the massive sizes of…

We answer positively the question of Albertson asking whether every planar graph can be $5$-list-colored even if it contains precolored vertices, as long as they are sufficiently far apart from each other. In order to prove this claim, we…

For a number $l\geq 2$, let ${\cal{G}}_l$ denote the family of graphs which have girth $2l+1$ and have no odd hole with length greater than $2l+1$. Wu, Xu and Xu conjectured that every graph in $\bigcup_{l\geq 2} {\cal{G}}_{l}$ is…

We study several natural classes of graphs on a zero-dimensional metrizable compact space having no continuous coloring. We compare these graphs with the quasi-order associated with injective continuous homomorphisms. We prove the existence…

Two celebrated conjectures in chromatic symmetric function theory concern the positivity chromatics symmetric functions of claw-free graphs. Here we extend the claw-free idea to general graphs and consider the e-positivity question for…

This article deals with homomorphisms of oriented graphs with respect to push equivalence. Here homomorphisms refer to arc preserving vertex mappings, and push equivalence refers to the equivalence class of orientations of a graph $G$ those…