Related papers: The Total Chromatic Quasisymmetric Functions of a …
Stanley asked whether a tree is determined up to isomorphism by its chromatic symmetric function. We approach Stanley's problem by studying the relationship between the chromatic symmetric function and other invariants. First, we prove…
A graph is said to be {\it total-colored} if all the edges and the vertices of the graph are colored. A total-coloring of a graph is a {\it total monochromatically-connecting coloring} ({\it TMC-coloring}, for short) if any two vertices of…
Various results ensure the existence of large complete bipartite graphs in properly colored graphs when some condition related to a topological lower bound on the chromatic number is satisfied. We generalize three theorems of this kind,…
We prove that the coefficient of the star $\mathfrak{st}_{21^{n-2}}$ in the chromatic symmetric function $X_G$ determines whether a connected graph $G$ is $2$-connected. We also prove new linear relations on other star coefficients of…
We prove a general inclusion-exclusion relation for the extended chromatic symmetric function of a weighted graph, which specializes to (extended) $k$-deletion, and we give two methods to obtain numerous new bases from weighted graphs for…
Let $\mathfrak g$ be a Borcherds algebra with the associated graph $G$. We prove that the chromatic symmetric function of $G$ can be recovered from the Weyl denominator identity of $\mathfrak g$ and this gives a Lie theoretic proof of…
We introduce two novel evolutionary formulations of the problem of coloring the nodes of a graph. The first formulation is based on the relationship that exists between a graph's chromatic number and its acyclic orientations. It views such…
This paper delves into three research directions, leveraging the Lov\'{a}sz $\vartheta$-function of a graph. First, it focuses on the Shannon capacity of graphs, providing new results that determine the capacity for two infinite subclasses…
We use a well known concept of proper vertex colouring of a graph to introduce the construction of a chromatic completion graph and its related parameter, the chromatic completion number of a graph. We then give the chromatic completion…
This paper realizes of two families of combinatorial symmetric functions via the complex character theory of the finite general linear group $\mathrm{GL}_{n}(\mathbb{F}_{q})$: chromatic quasisymmetric functions and vertical strip LLT…
Quasisymmetric functions have recently been used in time series analysis as polynomial features that are invariant under, so-called, dynamic time warping. We extend this notion to data indexed by two parameters and thus provide warping…
A vertex colouring of a graph is called asymmetric if the only automorphism which preserves it is the identity. Tucker conjectured that if every automorphism of a connected, locally finite graph moves infinitely many vertices, then there is…
A well-known result of Stanley's shows that given a graph $G$ with chromatic symmetric function expanded into the basis of elementary symmetric functions as $X_G = \sum c_{\lambda}e_{\lambda}$, the sum of the coefficients $c_{\lambda}$ for…
The asymmetric coloring number of a graph is the minimum number of colors needed to color its vertices, so that no non-trivial automorphism preserves the color classes. We investigate the asymmetric coloring number of graphs that are…
Stanley introduced the concept of chromatic symmetric functions of graphs which extends and refines the notion of chromatic polynomials of graphs, and asked whether trees are determined up to isomorphism by their chromatic symmetric…
Independently posed by Behzad and Vizing, the Total Coloring Conjecture asserts that the total chromatic number of a simple connected graph $G$ is either $\Delta(G)+1$ or $\Delta(G)+2$, where $\Delta(G)$ is the largest degree of any vertex…
We describe how the chromatic symmetric function of two graphs glued at a single vertex can be expressed as a matrix multiplication using certain information of the two individual graphs. We then prove new $e$-positivity results by using a…
Crew and Spirklt generalize Stanley's chromatic symmetric function to vertex-weighted graphs. One of the primary motivations for extending the chromatic symmetric function to vertex-weighted graphs is the existence of a deletion-contraction…
Determining whether two graphs are isomorphic is an important and difficult problem in graph theory. One way to make progress towards this problem is by finding and studying graph invariants that distinguish large classes of graphs. Stanley…
The oriented chromatic polynomial of a oriented graph outputs the number of oriented $k$-colourings for any input $k$. We fully classify those oriented graphs for which the oriented graph has the same chromatic polynomial as the underlying…