5
$\begingroup$

Suppose I have non-isomorphic graphs $G$ and $H$ (which have at least one edge), but such that their chromatic polynomials are the same. Can I then always find an edge $e$ in $G$ and $f$ in $H$ such that the chromatic polynomials for the deletions $G\setminus e$ and $H \setminus f$ coincide as well?

I suspect not, but I have not managed to construct a counterexample.

Improve this question
$\endgroup$
1
  • 2
    $\begingroup$ The keyword "chromatically equivalent" may help you find literature on this topic. $\endgroup$
    – Timothy Chow
    Commented Mar 14 at 7:50

0

Reset to default

You must log in to answer this question.