Related papers: Nice colourings and the 4-colour theorem
A linear coloring of a graph is a proper coloring of the vertices of the graph so that each pair of color classes induce a union of disjoint paths. In this paper, we prove that for every connected graph with maximum degree at most three and…
A distinguishing colouring of a graph is a colouring of the vertex set such that no non-trivial automorphism preserves the colouring. Tucker conjectured that if every non-trivial automorphism of a locally finite graph moves infinitely many…
Coloring planar Feynman diagrams in spinor quantum electrodynamics, is a non trivial model soluble without computer. Four colors are necessary and sufficient.
In 1999, at one of his last public lectures, Tutte discussed a question he had considered since the times of the Four Color Conjecture. He asked whether the 4-coloring complex of a planar triangulation could have two components in which all…
The Four color problem is closely related to other branches of mathematics and practical applications. More than 20 of its reformulations are known, which connect this problem with problems of algebra, statistical mechanics and planning.…
The Cyclic Coloring Conjecture asserts that the vertices of every plane graph with maximum face size D can be colored using at most 3D/2 colors in such a way that no face is incident with two vertices of the same color. The Cyclic Coloring…
It is proved that all 4-edge-colourings of a (sub)cubic graph are Kempe equivalent. This resolves a conjecture of the second author. In fact, it is found that the maximum degree Delta=3 is a threshold for Kempe equivalence of…
In a proper edge-coloring the edges of every color form a matching. A matching is induced if the end-vertices of its edges induce a matching. A strong edge-coloring is an edge-coloring in which the edges of every color form an induced…
Many graph coloring proofs proceed by showing that a minimal counterexample to the theorem being proved cannot contain certain configurations, and then showing that each graph under consideration contains at least one such configuration;…
For a plane near-triangulation $G$ with the outer face bounded by a cycle $C$, let $n^\star_G$ denote the function that to each $4$-coloring $\psi$ of $C$ assigns the number of ways $\psi$ extends to a $4$-coloring of $G$. The block-count…
If all but two vertices of a triangulated sphere have degrees divisible by $k$, then the exceptional vertices are not adjacent. This theorem is proved for $k=2$ with the help of the coloring monodromy. For $k = 3, 4, 5$ colorings by the…
We generalize the Five Color Theorem by showing that it extends to graphs with two crossings. Furthermore, we show that if a graph has three crossings, but does not contain K_6 as a subgraph, then it is also 5-colorable. We also consider…
A (minimal) transversal of a partition is a set which contains exactly one element from each member of the partition and nothing else. A coloring of a graph is a partition of its vertex set into anticliques, that is, sets of pairwise…
We prove that for any point set P in the plane, a triangle T, and a positive integer k, there exists a coloring of P with k colors such that any homothetic copy of T containing at least ck^8 points of P, for some constant c, contains at…
This paper has two-fold goal: it provides gentle introduction to Knot Theory starting from 3-coloring, the concept introduced by R. Fox to allow undergraduate students to see that the trefoil knot is non-trivial, and ending with statistical…
We show that the following problems are NP-complete. 1. Can the vertex set of a graph be partitioned into two sets such that each set induces a perfect graph? 2. Is the difference between the chromatic number and clique number at most $1$…
Two vertex colorings of a graph are Kempe equivalent if they can be transformed into each other by a sequence of switchings of two colors of vertices. It is PSPACE-complete to determine whether two given vertex $k$-colorings of a graph are…
In 1964 Vizing proved that starting from any k-edge-coloring of a graph G one can reach, using only Kempe swaps, a ($\Delta$ + 1)-edge-coloring of G where $\Delta$ is the maximum degree of G. One year later he conjectured that one can also…
A "dominating $K_t$-model" in a graph $G$ is a sequence $(T_1,\dots,T_t)$ of pairwise vertex-disjoint connected subgraphs of $G$, such that whenever $1\leq i<j\leq t$ every vertex in $T_j$ has a neighbour in $T_i$. Replacing "every vertex…
Bonamy et al. (2023) proved that an optimal edge coloring of a simple triangle--free graph $G$ can be reached from any given proper edge coloring of $G$ through a series of Kempe changes. We show that a small modification of their proof…