Related papers: Homogeneous Sets in Graphs and a Chromatic Multisy…

Motivated by a connection between the topology of (generalized) configuration spaces and chromatic polynomials, we show that generating functions of Hodge-Deligne polynomials of quasiprojective varieties and colorings of acyclic directed…

In 2015, Brown and Erey conjectured that every $2$-connected graph $G$ on $n$ vertices with chromatic number $k\geq 4$ has at most $(x-1)_{k-1}\big((x-1)^{n-k+1}+(-1)^{n-k}\big)$ proper $x$-colorings for all $x\geq k$. Engbers, Erey, Fox,…

It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…

Given a graph $G$ and a natural number $k$, the $k$-recolouring graph $\mathcal{C}_k(G)$ is the graph whose vertices are the $k$-colourings of $G$ and whose edges link pairs of colourings which differ at exactly one vertex of $G$. Recently,…

Graph coloring problems are a central topic of study in the theory of algorithms. We study the problem of partially coloring partially colorable graphs. For $\alpha \leq 1$ and $k \in \mathbb{Z}^+$, we say that a graph $G=(V,E)$ is…

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…

R.P. Stanley defined a invariant for graphs called the chromatic symmetric function and conjectured it is complete invariant for trees. Miezaki et al. generalised the chromatic symmetric function and defined the Kneser chromatic functions…

In this paper, we introduce a method called graph fusion embedding, designed for multi-graph embedding with shared vertex sets. Under the framework of supervised learning, our method exhibits a remarkable and highly desirable synergistic…

In this paper, a function on any pair of graphs is defined whose properties are similar to the properties of dot product in vector space. This function enables us to define graph orthogonality and, also, a new metric on isomorphism classes…

Coloring a graph $G$ consists in finding an assignment of colors $c: V(G)\to\{1,\ldots,p\}$ such that any pair of adjacent vertices receives different colors. The minimum integer $p$ such that a coloring exists is called the chromatic…

By a finite type-graph we mean a graph whose set of vertices is the set of all $k$-subsets of $[n]=\{1,2,\ldots, n\}$ for some integers $n\ge k\ge 1$, and in which two such sets are adjacent if and only if they realise a certain order type…

We study how the number $c(X)$ of components of a graph $X$ can be expressed through the number and properties of the components of a quotient graph $X/\sim.$ We partially rely on classic qualifications of graph homomorphisms such as…

We obtain improved upper bounds and new lower bounds on the chromatic number as a linear function of the clique number, for the intersection graphs (and their complements) of finite families of translates and homothets of a convex body in…

The $k$-th exact-distance graph, of a graph $G$ has $V(G)$ as its vertex set, and $xy$ as an edge if and only if the distance between $x$ and $y$ is (exactly) $k$ in $G$. We consider two possible extensions of this notion for signed graphs.…

The adjoint polynomial of $G$ is \[h(G,x)=\sum_{k=1}^n(-1)^{n-k}a_k(G)x^k,\] where $a_k(G)$ denotes the number of ways one can cover all vertices of the graph $G$ by exactly $k$ disjoint cliques of $G$. In this paper we show the the adjoint…

We study the complexity of graph modification problems with respect to homomorphism-based colouring properties of edge-coloured graphs. A homomorphism from edge-coloured graph $G$ to edge-coloured graph $H$ is a vertex-mapping from $G$ to…

We study the problem of maximizing the number of independent sets in $n$-vertex $k$-chromatic $\ell$-connected graphs. First we consider maximizing the total number of independent sets in such graphs with $n$ sufficiently large, and for…

For an integer k >= 1, the k-th interlacing adjoint of a digraph G is the digraph i_k(G) with vertex-set V(G)^k, and arcs ((u_1, ..., u_k), (v_1, ..., v_k)) such that (u_i,v_i) \in A(G) for i = 1, ..., k and (v_i, u_{i+1}) \in A(G) for i =…

We show that the discrete versions of the systolic inequality that estimate the number of vertices of a simplicial complex from below have substantial applications to graphs, the one-dimensional simplicial complexes. Almost directly they…

The reconfiguration graph $R_k(G)$ of the $k$-colourings of a graph $G$ contains as its vertex set the $k$-colourings of $G$ and two colourings are joined by an edge if they differ in colour on just one vertex of $G$. We show that for each…