The chromaticity of a family of G_k(a,b;c,d) graphs

MaRDI QIDQ3366862zbMATH OpenFDO

Authors Xuefeng Li, Qiujuan Tong

Publication date 16 February 2006

zbMATH Keywords

chromatic polynomialchromatic unique

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 702157
• Chromatic uniqueness in a family of 2-connected graphs
• Chromatically unique multibridge graphs
• Chromatically unique 6-bridge graph \(\theta(a,a,a,b,b,c)\)
• Chromaticity of the 6-bridge graph (a,a,a,b,c,c)

Cited in

(6)

• On the chromatic equivalence class of a family of graphs
• Chromatic uniqueness in a family of 2-connected graphs
• Chromatically unique multibridge graphs
• Chromaticity of the graph (a,b,c,d,e)
• scientific article; zbMATH DE number 5630524 (Why is no real title available?)
• On chromatic uniqueness of two infinite families of graphs

This page was built for publication: The chromaticity of a family of \(G_k(a,b;c,d)\) graphs

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