The pseudoachromatic number of a graph

DOI10.1007/s10012-000-0129-zzbMath0959.05043OpenAlexW2017278757MaRDI QIDQ1586845

V. Yegnanarayanan

Publication date: 19 March 2001

Published in: Southeast Asian Bulletin of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10012-000-0129-z

zbMATH Keywords

chromatic numberachromatic numberpseudoachromatic numberpseudocomplete coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Geometric achromatic and pseudoachromatic indices ⋮ On the Pseudo-achromatic Number Problem ⋮ Achromatic numbers for circulant graphs and digraphs ⋮ Complete colorings of planar graphs ⋮ Graph colourings and partitions ⋮ On the pseudo-achromatic number problem

This page was built for publication: The pseudoachromatic number of a graph