scientific article; zbMATH DE number 6260058

zbMATH Open1289.05176MaRDI QIDQ5397205FDOQ5397205

Authors Jianfeng Wang, Francesco Belardo, Chengfu Ye, Qiongxiang Huang, K. L. Teo, Ru Ying Liu

Publication date 19 February 2014

zbMATH Keywords

chromatic polynomialschromatically uniqueadjoint polynomialsadjointly unique graphs

Mathematics Subject Classification ID

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

Recommendations

• Chromatic uniqueness of certain complete \(t\)-partite graphs
• scientific article; zbMATH DE number 1094005
• On T-chromatic uniqueness of graphs
• The chromatic uniqueness of complete bipartite graphs
• scientific article; zbMATH DE number 742643
• Chromatic uniqueness of complete \(t\)-partite graphs \(K(n-k,n,\dots, n)\)
• The chromatic uniqueness of certain complete \(t\)-partite graphs.
• scientific article; zbMATH DE number 4099332
• On equitable chromatic number of tadpole graph \(t_{m,n}\)
• Uniquely \(n\)-colorable and chromatically equivalent graphs

Cited in

(1)

• Chromaticity of the complements of some sparse graphs

This page was built for publication:

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