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

DOI10.1016/0012-365X(94)00056-OzbMATH Open0837.05055MaRDI QIDQ1901034FDOQ1901034

Authors: Yanpei Liu, F. M. Dong 

Publication date: 23 April 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

chromatic polynomialwheelchromatic uniquenesschromatically equivalentchromatically unique

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• A bibliography on chromatic polynomials
• On the join of graphs and chromatic uniqueness
• Title not available (Why is that?)
• Title not available (Why is that?)
• The search for chromatically unique graphs. II
• A note on the chromatic uniqueness of \(W_ 10\)

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)