Some chromatic equivalence classes of complete multipartite graphs

MaRDI QIDQ4604345zbMATH OpenFDO

Authors G. C. Lau, Haixing Zhao

Publication date 23 February 2018

zbMATH Keywords

chromatic equivalence classchromatic polynomialcomplete multipartite graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Structural characterization of families of graphs (05C75)

Recommendations

• Chromatic equivalence classes of complete tripartite graphs
• 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
• The chromatic uniqueness of certain complete t-partite graphs.

Cited in

(6)

• On the chromaticity of complete multipartite graphs with certain edges added
• On the chromatic equivalence class of a family of graphs
• Equitable chromatic number of complete multipartite graphs
• Independence equivalence classes of cycles
• The chromatic equivalence class of \(K_{1, n, n + 2}\)
• Chromatic equivalence classes of complete tripartite graphs

This page was built for publication: Some chromatic equivalence classes of complete multipartite graphs

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