We propose two conjectures on the chromatic polynomial of a graph and show their validity for several classes of graphs. Our conjectures are stronger than an older conjecture of Bartels and Welsh [1].
Two Conjectures on the Chromatic Polynomial
NOBILI, Paolo
2000-01-01
Abstract
We propose two conjectures on the chromatic polynomial of a graph and show their validity for several classes of graphs. Our conjectures are stronger than an older conjecture of Bartels and Welsh [1].File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
