scientific article; zbMATH DE number 812060

MaRDI QIDQ4853734zbMATH OpenFDO

Authors K. M. Koh, Chung-Piaw Teo

Publication date 2 November 1995

zbMATH Keywords

chromatic equivalencechromatic polynomialchromatically equivalent

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 4089574
• On chromatic equivalence of graphs
• scientific article; zbMATH DE number 4087686
• Complementary graphs and the chromatic number
• On the chromatic equivalence class of graphs
• Pairs of chromatically equivalent graphs
• scientific article; zbMATH DE number 5073889
• Coloring graphs which have equibipartite complements
• scientific article; zbMATH DE number 773170
• A sufficient and necessary condition for the chromatic equivalence of a class of graphs

Cited in

(5)

• A bibliography on chromatic polynomials
• The chromatic polynomial between graph \& its complement---about Akiyama and Harary's open problem
• scientific article; zbMATH DE number 5073889 (Why is no real title available?)
• scientific article; zbMATH DE number 892216 (Why is no real title available?)
• Tutte polynomials and a stronger version of the Akiyama-Harary problem

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 Q4853734)