相关论文: Planar rook algebra with colors and Pascal's simpl…

We introduce a representation via (n+1)-colored graphs of compact n-manifolds with (possibly empty) boundary, which appears to be very convenient for computer aided study and tabulation. Our construction is ageneralization to arbitrary…

Let $G$ be a simple undirected graph on $n$ vertices with maximum degree~$\Delta$. Brooks' Theorem states that $G$ has a $\Delta$-colouring unless~$G$ is a complete graph, or a cycle with an odd number of vertices. To recolour $G$ is to…

We explore the interplay between algebraic combinatorics and algorithmic problems in graph theory by defining a polynomial with connections to correspondence colouring (also known as DP-colouring), a recent generalization of list-colouring,…

Given a sextuple of distinct points $A, B, C, D, E, F$ on a conic, arranged into an array $\left[\begin{array}{ccc} A & B & C F & E & D \end{array}\right]$, Pascal's theorem says that the points $AE \cap BF, BD \cap CE, AD \cap CF$ are…

We say that a sequence $a_1 \cdots a_{2t}$ of integers is repetitive if $a_i = a_{i+t}$ for every $i\in\{1,\ldots,t\}$. A walk in a graph $G$ is a sequence $v_1 \cdots v_r$ of vertices of $G$ in which $v_iv_{i+1}\in E(G)$ for every…

If $\Gamma<\mathrm{PSL}(2,\mathbb{C})$ is a lattice, we define an invariant of a representation $\Gamma\rightarrow \mathrm{PSL}(n,\mathbb{C})$ using the Borel class $\beta(n)\in…

In 1880, P. G. Tait showed that the four colour theorem is equivalent to the assertion that every 3-regular planar graph without cut-edges is 3-edge-colourable, and in 1891, J. Petersen proved that every 3-regular graph with at most two…

The study of graph vertex colorability from an algebraic perspective has introduced novel techniques and algorithms into the field. For instance, it is known that $k$-colorability of a graph $G$ is equivalent to the condition $1 \in…

An $(r-1,1)$-coloring of an $r$-regular graph $G$ is an edge coloring such that each vertex is incident to $r-1$ edges of one color and $1$ edge of a different color. In this paper, we completely characterize all $4$-regular pseudographs…

A graph is IC-planar if it admits a drawing in the plane with at most one crossing per edge and such that two pairs of crossing edges share no common end vertex. IC-planarity specializes both NIC-planarity, which allows a pair of crossing…

A nonrepetitive coloring of a path is a coloring of its vertices such that the sequence of colors along the path does not contain two identical, consecutive blocks. The remarkable construction of Thue asserts that 3 colors are enough to…

Let $W^c(A_n)$ be the set of fully commutative elements in the $A_n$-type Coxeter group. Using only the settings of their canonical form, we recount $W^c(A_n)$ by the recurrence that is taken as a definition of the Catalan number $C_{n+1}$…

A graph \( G \) is said to be (vertex) non-repetitively colored if no simple path in \( G \) has a sequence of vertex colors that forms a repetition. Formally, a coloring \( c: V(G) \to \{1, 2, \dots, k\} \) is non-repetitive if, for every…

This paper describes several new problems and ideas concerning algebraic geometry and complexity theory. It first uses the idea of coloring graphs with elements of finite fields. This procedure then shows that graph coloring problems can be…

A vertex coloring of a simplicial complex $\Delta$ is called a linear coloring if it satisfies the property that for every pair of facets $(F_1, F_2)$ of $\Delta$, there exists no pair of vertices $(v_1, v_2)$ with the same color such that…

Similar to Euclidean geometry, graph theory is a science that studies figures that consist of points and lines. The core of Euclidean geometry is the parallel postulate, which provides the basis of the geometric invariant that the sum of…

Alon et al. introduced the concept of non-repetitive colourings of graphs. Here we address some questions regarding non-repetitive colourings of planar graphs. Specifically, we show that the faces of any outerplanar map can be…

Let $k \geq 1$ be an integer. The reconfiguration graph $R_k(G)$ of the $k$-colourings of a graph~$G$ has as vertex set the set of all possible $k$-colourings of $G$ and two colourings are adjacent if they differ on exactly one vertex. A…

We study the algorithmic decidability of the domination number in the Erdos-Renyi random graph model $G(n,p)$. We show that for a carefully chosen edge probability $p=p(n)$, the domination problem exhibits a strong irreducible property.…

A $1$-plane graph is a graph embedded in the plane such that each edge is crossed at most once. A NIC-plane graph is a $1$-plane graph such that any two pairs of crossing edges share at most one end-vertex. An edge partition of a $1$-plane…