Chromaticity of certain bipartite graph with five edges deleted

MaRDI QIDQ3520710zbMATH OpenFDO

Authors Roslan Hasni, Y. H. Peng

Publication date 26 August 2008

zbMATH Keywords

chromatic polynomialchromatically equivalencechromatically unique

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 5759616
• Chromatic uniqueness of certain bipartite graphs with six edges deleted
• scientific article; zbMATH DE number 5809759
• Chromaticity of bipartite graphs with seven edges deleted.
• Chromatic uniqueness of complete bipartite graphs with certain edges deleted.

Cited in

(3)

• Chromaticity of bipartite graphs with seven edges deleted.
• Chromatic uniqueness of certain bipartite graphs with six edges deleted
• scientific article; zbMATH DE number 5759616 (Why is no real title available?)

This page was built for publication: Chromaticity of certain bipartite graph with five edges deleted

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