Achromatic number versus pseudoachromatic number: A counterexample to a conjecture of Hedetniemi

DOI10.1016/S0012-365X(00)00025-XzbMath0948.05026OpenAlexW2026543669WikidataQ123162527 ScholiaQ123162527MaRDI QIDQ1567683

Keith J. Edwards

Publication date: 21 June 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00025-x

zbMATH Keywords

treesachromatic numbervertex coloringpseudoachromatic numberconjecture of Hedetniemi

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Complete partitions of graphs ⋮ My Top 10 Graph Theory Conjectures and Open Problems ⋮ Inequalities involving the irredundance number of a graph

This page was built for publication: Achromatic number versus pseudoachromatic number: A counterexample to a conjecture of Hedetniemi