Chromatic equivalence classes of complete tripartite graphs

MaRDI QIDQ5891464zbMATH OpenFDO

Authors Chee-Kit Ho, Gek L. Chia

Publication date 25 August 2014

Published in Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL http://www.emis.de/journals/BMMSS/vol37_3_3.html

zbMATH Keywords

chromatic polynomialcomplete tripartite graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph polynomials (05C31)

Recommendations

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

Cited in

(7)

• Independence equivalence classes of cycles
• The chromatic equivalence class of \(K_{1, n, n + 2}\)
• The edge cover chromatic index of complete tripartite graphs
• scientific article; zbMATH DE number 742642 (Why is no real title available?)
• Some chromatic equivalence classes of complete multipartite graphs
• scientific article; zbMATH DE number 2119970 (Why is no real title available?)
• Chromatic equivalence classes of complete tripartite graphs

This page was built for publication: Chromatic equivalence classes of complete tripartite graphs

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