Defective chromatic polynomials

TL;DR

This paper studies defective chromatic polynomials, revealing how their full family determines certain graph properties and providing contraction formulas, with applications to triangle-free graphs and trees.

Contribution

It introduces a contraction formula for defective chromatic polynomials and explores their ability to determine structural graph properties, including degree sequences and subgraph counts.

Findings

Full family determines degree sequence for triangle-free graphs.

Family determines path-subgraph counts for trees up to length 4.

Constructs nonisomorphic trees with identical defective chromatic polynomials for all d.

Abstract

For a graph $G$ and an integer $d\geq 0$, the defective chromatic polynomial $\chi_d(G;k)$ counts the $k$-colorings of $G$ in which each vertex has at most $d$ neighbors of its own color. We investigate which structural properties of $G$ are determined by the full family $\{\chi_d(G;k)\}_{d\geq 0}$. We establish a contraction formula expressing $\chi_d(G;k)$ as a sum of ordinary chromatic polynomials of the edge contractions of $G$. As a first application, we prove that for triangle-free graphs, the full family determines the degree sequence. For trees, we show further that the family $\{\chi_d(T;k)\}_{d\geq 0}$ determines the path-subgraph counts $N(P_j,T)$ for $j=1,2,3,4$, but not for $j=5$. For each $n\geq 9$, we construct a pair of nonisomorphic trees of order $n$ that share the same defective chromatic polynomials for every $d\geq 0$.