On the chromatic uniqueness of the graph W(n,n-2)+K_ k

DOI10.1016/0012-365X(94)00056-OMaRDI QIDQ1901034zbMATH OpenFDO

Authors Yanpei Liu, F. M. Dong

Publication date 23 April 1996

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

chromatic polynomialwheelchromatic uniquenesschromatically equivalentchromatically unique

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Recommendations

• On the chromatic uniqueness of the graph \(W(n,n-2,k)\)
• scientific article; zbMATH DE number 742643
• Chromatic uniqueness in a family of 2-connected graphs
• The chromaticity of wheels with a missing spoke
• On the join of graphs and chromatic uniqueness

Cites work

• Chromaticity of two-trees
• Onq-trees
• The chromaticity of wheels with a missing spoke
• The search for chromatically unique graphs

Cited in

(7)

• The chromaticity of the join of tree and null graph
• scientific article; zbMATH DE number 742643 (Why is no real title available?)
• scientific article; zbMATH DE number 3952796 (Why is no real title available?)
• A bibliography on chromatic polynomials
• A note on the chromatic uniqueness of \(W_ 10\)
• On the join of graphs and chromatic uniqueness
• The search for chromatically unique graphs. II

This page was built for publication: On the chromatic uniqueness of the graph \(W(n,n-2)+K_ k\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1901034)