Chromaticity of certain tripartite graphs identified with a path

DOI10.1016/J.DISC.2006.05.029MaRDI QIDQ860454zbMATH OpenOpenAlexFDO

Authors G. C. Lau, Y. H. Peng

Publication date 9 January 2007

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2006.05.029

zbMATH Keywords

chromatic polynomialchromatically equivalentchromatically unique

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 702157
• The chromatic equivalence class of \(K_{1, n, n + 2}\)
• On chromatic uniqueness of some complete tripartite graphs
• Chromatic uniqueness of a number of complete tripartite graphs
• About chromatic uniqueness of some complete tripartite graphs

Cites work

• scientific article; zbMATH DE number 3961645 (Why is no real title available?)
• scientific article; zbMATH DE number 2188338 (Why is no real title available?)
• Cutpoints and the chromatic polynomial
• On chromatic coefficients
• On the chromatic uniqueness of edge-gluing of complete tripartite graphs and cycles
• The list of chromatically unique graphs of order seven and eight

Cited in

(1)

• scientific article; zbMATH DE number 6007676 (Why is no real title available?)

This page was built for publication: Chromaticity of certain tripartite graphs identified with a path

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