相关论文: Reduced chromatic graph cohomology
The clustered chromatic number of a graph class $\mathcal{G}$ is the minimum integer $c$ such that every graph $G\in\mathcal{G}$ has a $c$-colouring where each monochromatic component in $G$ has bounded size. We study the clustered…
Cographs are exactly hereditarily well-colored graphs, i.e., the graphs for which a greedy coloring of every induced subgraph uses only the minimally necessary number of colors $\chi(G)$. In recent work on reciprocal best match graphs…
Given a graph $G$ and a positive integer $d$, an orthogonal vector $d$-coloring of $G$ is an assignment $f$ of vectors of $\mathbb{R}^d$ to $V(G)$ in such a way that adjacent vertices receive orthogonal vectors. The orthogonal chromatic…
Multipath cohomology is a cohomology theory for directed graphs, which is defined using the path poset. The aim of this paper is to investigate combinatorial properties of path posets, and to provide computational tools for multipath…
In this paper, we introduce and study two variants of the chromatic quasisymmetric function of a graph: the total chromatic quasisymmetric function via vertex labeling and via acyclic orientations. The original definition of the chromatic…
The chromatic symmetric function $X_G$ is a power series that encodes the proper colorings of a graph $G$ by assigning a variable to each color and a monomial to each coloring such that the power of a variable in a monomial is the number of…
Let H be a graph, and let C_H(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating C_H(G). Previous results cover only a few specific instances of this general…
The Hom complex ${\rm Hom}(T,G)$ of graphs is a CW-complex associated to a pair of graphs $T$ and $G$, considered in the graph coloring problem. It is known that certain homotopy invariants of ${\rm Hom}(T,G)$ give lower bounds for the…
A hamiltonian coloring c of a graph G of order p is an assignment of colors to the vertices of G such that $D(u,v)+|c(u)-c(v)|\geq p-1$ for every two distinct vertices u and v of G, where D(u,v) denoted the detour distance between u and v.…
There are many concepts of signed graph coloring which are defined by assigning colors to the vertices of the graphs. These concepts usually differ in the number of self-inverse colors used. We introduce a unifying concept for this kind of…
In this paper we prove the knight move theorem for the chromatic graph cohomologies with rational coefficients introduced by L. Helme-Guizon and Y. Rong. Namely, for a connected graph G with n vertices the only non-trivial cohomology groups…
The chromatic number of a graph is the minimum $k$ such that the graph has a proper $k$-coloring. There are many coloring parameters in the literature that are proper colorings that also forbid bicolored subgraphs. Some examples are…
Given a graph G, the graph associahedron is a simple convex polytope whose face poset is based on the connected subgraphs of G. With the additional assignment of a color palette, we define the colorful graph associahedron, show it to be a…
In this paper, we establish a new zeta function based on the Bartholdi zeta function for an undirected graph G called the reduced Bartholdi zeta function. We study the relation between its coefficients and the structure of the graph, and…
We investigate the property of a spatial graph of having a leveled embedding and characterize the abstract graphs with this property. We show that all leveled embeddings are free and we compare leveled and paneled (also known as flat)…
In the present note we show, via the connection between chromatic polynomial and Potts model, that the Whitney Broken circuit theorem is in fact a special case of a more general identity relating the chromatic polynomial of a graph G=(V,E)…
In 2006, Collins and Trenk obtained a general sharp upper bound for the distinguishing chromatic number of a connected graph. Inspired by Catlin's combinatorial techniques from 1978, we establish improved upper bounds for classes of…
In this short note we observe that recent results of Abert and Hubai and of Csikvari and Frenkel about Benjamini--Schramm continuity of the holomorphic moments of the roots of the chromatic polynomial extend to the theory of dense graph…
The chromatic symmetric function of a graph is a generalization of the chromatic polynomial. The key motivation for studying the structure of a chromatic symmetric function is to answer positivity conjectures by Stanley in 1995 and Gasharov…
We study Dohmen--P\"onitz--Tittmann's bivariate chromatic polynomial $c_\Gamma(k,l)$ which counts all $(k+l)$-colorings of a graph $\Gamma$ such that adjacent vertices get different colors if they are $\le k$. Our first contribution is an…