On ?-equivalence and ?-equivalence of graphs

DOI<211::AID-JGT11>3.0.CO;2-M 10.1002/(SICI)1097-0118(199602)21:2<211::AID-JGT11>3.0.CO;2-MzbMath0838.05050OpenAlexW2007392371MaRDI QIDQ4865534

Qingyan Du

Publication date: 25 February 1996

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199602)21:2<211::aid-jgt11>3.0.co;2-m

zbMATH Keywords

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

The search for chromatically unique graphs. II ⋮ A bibliography on chromatic polynomials

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