相关论文: Defective colouring of graphs excluding a subgraph…

Colouring problems arising from group-based constructions provide a natural link between combinatorics and algebra, particularly in the study of Cayley graphs and Latin squares. We introduce the notion of colouring bijections of finite…

A \emph{proper $t$-edge-coloring} of a graph $G$ is a mapping $\alpha: E(G)\rightarrow \{1,\ldots,t\}$ such that all colors are used, and $\alpha(e)\neq \alpha(e^{\prime})$ for every pair of adjacent edges $e,e^{\prime}\in E(G)$. If $\alpha…

It was conjectured by the third author in about 1973 that every $d$-regular planar graph (possibly with parallel edges) can be $d$-edge-coloured, provided that for every odd set $X$ of vertices, there are at least $d$ edges between $X$ and…

We look at colourings of $r$-uniform hypergraphs, focusing our attention on unique colourability and gaps in the chromatic spectrum. The pattern of an edge $E$ in an $r$-uniform hypergraph $H$ whose vertices are coloured is the partition of…

For graph classes $P_1,...,P_k$, Generalized Graph Coloring is the problem of deciding whether the vertex set of a given graph $G$ can be partitioned into subsets $V_1,...,V_k$ so that $V_j$ induces a graph in the class $P_j$…

In this paper, we introduce the notion of $t$-tone edge coloring. A $t$-tone edge $k$-coloring of a graph $G$ assigns to each edge of $G$ a set of $t$ distinct colors from $\{1,\dots,k\}$ such that any two edges at distance $d$ share fewer…

A proper conflict-free colouring of a graph is a colouring of the vertices such that any two adjacent vertices receive different colours, and for every non-isolated vertex $v$, some colour appears exactly once on the neighbourhood of $v$.…

It is proved that for integers $b, r$ such that $3 \leq b < r \leq \binom{b+1}{2} - 1$, there exists a red/blue edge-colored graph such that the red degree of every vertex is $r$, the blue degree of every vertex is $b$, yet in the closed…

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…

Given integers $m\le c$ and an exact $c$-coloring of the edges of a complete countably infinite graph (i.e. a coloring that uses exactly $c$ colors), must there be an infinite subgraph that is exactly $m$-colored? Using the Infinite Ramsey…

We prove that any graph $G$ of minimum degree greater than $2k^2-1$ has a $(k+1)$-connected induced subgraph $H$ such that the number of vertices of $H$ that have neighbors outside of $H$ is at most $2k^2-1$. This generalizes a classical…

We prove the existence of a function $f :\mathbb{N} \to \mathbb{N}$ such that the vertices of every planar graph with maximum degree $\Delta$ can be 3-colored in such a way that each monochromatic component has at most $f(\Delta)$ vertices.…

We consider the problem of list edge coloring for planar graphs. Edge coloring is the problem of coloring the edges while ensuring that two edges that are incident receive different colors. A graph is k-edge-choosable if for any assignment…

The colouring defect of a cubic graph is the smallest number of edges left uncovered by any set of three perfect matchings. While $3$-edge-colourable graphs have defect $0$, those that cannot be $3$-edge-coloured (that is, snarks) are known…

We prove that for every $d\in \mathbb{N}$ and a graph class of bounded expansion $\mathscr{C}$, there exists some $c\in \mathbb{N}$ so that every graph from $\mathscr{C}$ admits a proper coloring with at most $c$ colors satisfying the…

Call a colouring of a graph \emph{distinguishing} if the only automorphism of this graph which preserves said colouring is the identity. Let $H$ be an arbitrary graph. We say that a graph $G$ is \emph{$H$-free} if $G$ does not contain an…

We introduce a new invariant of a cubic graph - its regular colouring defect - which is defined as the smallest number of edges left uncovered by any collection of three perfect matchings that have no edge in common. This invariant is a…

Hadwiger's famous coloring conjecture states that every $t$-chromatic graph contains a $K_t$-minor. Holroyd [Bull. London Math. Soc. 29, (1997), pp. 139--144] conjectured the following strengthening of Hadwiger's conjecture: If $G$ is a…

Brooks' Theorem is a fundamental result on graph colouring, stating that the chromatic number of a graph is almost always upper bounded by its maximal degree. Lov\'asz showed that such a colouring may then be computed in linear time when it…

Let $G$ be an edge-coloured graph. The minimum colour degree $\delta^c(G)$ of $G$ is the largest integer $k$ such that, for every vertex $v$, there are at least $k$ distinct colours on edges incident to $v$. We say that $G$ is properly…