On classification of graphs by chromatic polynomials

zbMATH Open1261.05026MaRDI QIDQ4918904FDOQ4918904

Authors: Ainul Maulid Ahmad, Roslan Hasni 

Publication date: 7 May 2013

Full work available at URL: http://www.m-hikari.com/ams/ams-2012/ams-57-60-2012/index.html

Recommendations

• scientific article; zbMATH DE number 6133138
• On chromatic equivalence of a pair of \(K_4\)-homeomorphs
• Chromatic equivalence of \(K_4\)-homeomorphs with girth 11
• On chromatic uniqueness of a family of \(K_4\)-homeomorphs. II
• Complete solution to chromatic uniqueness of \(K_4\)-homeomorphs with girth 9

zbMATH Keywords

chromatic polynomialchromatic equivalence\(K_4\)-homeomorphs

Mathematics Subject Classification ID

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

Cited In (9)

• A brute-force method for studying the chromatic properties of homeomorphic graphs.
• Title not available (Why is that?)
• On chromatic equivalence pair of a family of \(K_4\)-homeomorphs
• Complete solution to chromatic uniqueness of \(K_4\)-homeomorphs with girth 9
• On chromatic equivalence of a pair of \(K_4\)-homeomorphs
• Chromatic uniqueness and equivalence ofK4 homeomorphs
• Chromatic equivalence of \(K_4\)-homeomorphs with girth 11
• An attempt to classify bipartite graphs by chromatic polynomials
• Title not available (Why is that?)

This page was built for publication: On classification of graphs by chromatic polynomials

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