Discrete MathematicsVolume 27, Issue 2, 1979, Pages 171-177Chromatically unique graphsAuthor links open overlay panelChong-Yun Chao, Earl Glen Whitehead Jr.Show moreShareCitehttps://doi.org/10.1016/0012-365X(79)90107-9Get rights and contentUnder an Elsevier user licenseopen archiveAbstractWe show that two infinite families of graphs are chromatically unique. The graphs in these families can be obtained from the wheel graphs by deleting some of the spoke edges. Also, we prove that certain related graphs are not chromatically unique.Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1979 Published by Elsevier B.V.
