On ?-equivalence and ?-equivalence of graphs

DOI10.1002/(SICI)1097-0118(199602)21:2%3C211::AID-JGT11%3E3.0.CO;2-MMaRDI QIDQ4865534zbMATH OpenOpenAlexFDO

Authors Qing Yan Du

Publication date 25 February 1996

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199602)21:2%3C211::aid-jgt11%3E3.0.co;2-m

zbMATH Keywords

chromatic polynomial\(\sigma\)-polynomial\(\sigma\)-equivalence\(\sigma\)-uniqueness

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• On \(\sigma\)-polynomials and a class of chromatically unique graphs
• The graph polynomials and their equivalence
• \(\sigma\)-polynomials
• Classification of chromatically unique graphs having quadratic σ‐polynomials
• Homomorphism and sigma polynomials

Cited in

(7)

• \(\sigma\)-polynomials
• A bibliography on chromatic polynomials
• On \(\sigma\)-polynomials
• Homomorphism and sigma polynomials
• The graph polynomials and their equivalence
• The search for chromatically unique graphs. II
• On \(\sigma\)-polynomials and a class of chromatically unique graphs

This page was built for publication: On ?-equivalence and ?-equivalence of graphs

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