On the pseudoachromatic number of a graph

DOI10.4064/fm-102-3-159-164zbMath0396.05021OpenAlexW796915068MaRDI QIDQ4179038

V. N. Bhave

Publication date: 1979

Published in: Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/211008

zbMATH Keywords

Pseudoachromatic Number of a Graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (14)

Extendiendo un resultado de coloraciones de gráficas a coloraciones de digráficas ⋮ The achromatic number of the union of cycles ⋮ On the Pseudo-achromatic Number Problem ⋮ On upper bounds for the pseudo-achromatic index ⋮ Complete oriented colourings and the oriented achromatic number ⋮ Bounding the pseudoachromatic index of the complete graph via projective planes ⋮ Decomposition of a complete graph into trails of given lengths ⋮ Complete colorings of planar graphs ⋮ Minimum order of graphs with given coloring parameters ⋮ Complete partitions of graphs ⋮ Graph colourings and partitions ⋮ The diachromatic number of digraphs ⋮ On the pseudo-achromatic number problem ⋮ On the pseudoachromatic index of the complete graph

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