Abstract
A sufficient condition for two graphs with the same number of nodes to have the same chromatic polynomial is given.
Open Access
A result on co-chromatic graphs
Received17 Dec 1979
Revised18 Apr 1980
Copyright
Copyright © 1981 Hindawi Publishing Corporation. This is an open access article distributed under the
Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.