International Journal of Mathematics and Mathematical Sciences
Volume 4 (1981), Issue 2, Pages 365-369
doi:10.1155/S0161171281000227
A result on co-chromatic graphs
E.J. Farrell
Department of Mathematics, The University of the West Indies, St. Augustine, Trinidad and Tobago
Abstract
A sufficient condition for two graphs with the same number of nodes to have the same chromatic polynomial is given.