Related papers: The chromatic polynomial of fatgraphs and its cate…
The automorphisms of a graph act naturally on its set of labeled imbeddings to produce its unlabeled imbeddings. The imbedding sum of a graph is a polynomial that contains useful information about a graph's labeled and unlabeled imbeddings.…
A graph coloring has bounded clustering if each monochromatic component has bounded size. This paper studies such a coloring, where the number of colors depends on an excluded complete bipartite subgraph. This is a much weaker assumption…
We consider 3 (weighted) posets associated with a graph G - the poset P(G) of distinct induced unlabelled subgraphs, the lattice Omega(G) of distinct unlabelled graphs induced by connected partitions, and the poset Q(G) of distinct…
We study "holomorphic quadratic differentials" on graphs. We relate them to the reactive power in an LC circuit, and also to the chromatic polynomial of a graph. Specifically, we show that the chromatic polynomial $\chi$ of a graph $G$, at…
We employ the sl(2) foam cohomology to define a cohomology theory for oriented framed tangles whose components are labelled by irreducible representations of U_q(sl(2)). We show that the corresponding colored invariants of tangles can be…
Let $G = (V,E)$ be a finite, simple, connected graph with chromatic polynomial $P_G(q)$. Sokal \cite{sokal} proved that the roots of the chromatic polynomial of $G$ are bounded in absolute value by $KD$ where, $D$ is the maximum degree of…
In [2] Kauffman and Vogel constructed a rigid vertex regular isotopy invariant for unoriented four-valent graphs embedded in three dimensional space. It assigns to each embedded graph G a polynomial, denoted [G], in three variables, A, B…
In this paper, we study the graph classification problem from the graph homomorphism perspective. We consider the homomorphisms from $F$ to $G$, where $G$ is a graph of interest (e.g. molecules or social networks) and $F$ belongs to some…
We introduce two coproducts on mixed graphs (that is to say graphs with both oriented and unoriented edges), the first one by separation of the vertices into two parts, and the second one given by contraction and extractions of subgraphs.…
Recently, Chmutov introduced the partial duality of ribbon graphs, which can be regarded as a generalization of the classical Euler-Poincar\'e duality. The partial-dual genus polynomial $^\partial\varepsilon_G(z)$ is an enumeration of the…
We show that the Kauffman bracket $[L]$ of a checkerboard colorable virtual link $L$ is an evaluation of the Bollob\'as-Riordan polynomial $R_{G_L}$ of a ribbon graph associated with $L$. This result generalizes Thistlethwaite's celebrated…
The classic enumerative functions for counting colorings of a graph $G$, such as the chromatic polynomial $P(G,k)$, do so under the assumption that the given graph is labeled. In 1985, Hanlon defined and studied the chromatic polynomial for…
Let L be a link in an thickened annulus. We specify the embedding of this annulus in the three sphere, and consider its complement thought of as the axis to L. In the right circumstances this axis lifts to a null-homologous knot in the…
We put a new spin on Khovanov--Rozansky homology. That is, we equip $\Lambda^n$-colored $\mathfrak{sl}_{2n}$ Khovanov--Rozansky homology with an involution whose $\pm 1$-eigenspaces are link invariants. When $n=1,2,3$ (and assuming…
In this paper, two recursion formulae of chromatic polynomial of a maximal planar graph G are obtained. Moreover, the application of these formulaes to the proof of Four-Color Conjecture is investigated. By using these formulae, the proof…
The reconstruction conjecture has remained open for simple undirected graphs since it was suggested in 1941 by Kelly and Ulam. In an attempt to prove the conjecture, many graph invariants have been shown to be reconstructible from the…
We introduce path-conjoined graphs defined for two rooted graphs by joining their roots with a path, and investigate the chromatic symmetric functions of its two generalizations: spider-conjoined graphs and chain-conjoined graphs. By using…
For each graph, we construct a bigraded chain complex whose graded Euler characteristic is a version of the Tutte polynomial. This work is motivated by earlier work of Khovanov, Helme-Guizon and Rong, and others.
We partially solve the conjecture by A.Shumakovitch about torsion in the Khovanov homology of prime, non-split links in S^3. We give a size restriction on the Khovanov homology of almost alternating links. We relate the Khovanov homology of…
We study a very large family of graphs, the members of which comprise disjoint paths of cliques with extremal cliques identified. This broad characterisation naturally generalises those of various smaller families of graphs having…