Harmonious chromatic number of directed graphs

DOI10.1016/j.dam.2012.09.003zbMath1255.05079OpenAlexW2079746874MaRDI QIDQ1932457

Keith J. Edwards

Publication date: 18 January 2013

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

Full work available at URL: https://doi.org/10.1016/j.dam.2012.09.003

zbMATH Keywords

directed graphcomplete colouringharmonious colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (9)

Extendiendo un resultado de coloraciones de gráficas a coloraciones de digráficas ⋮ The digrundy number of digraphs ⋮ Achromatic numbers for circulant graphs and digraphs ⋮ Complete acyclic colorings ⋮ Complete oriented colourings and the oriented achromatic number ⋮ On the achromatic number of signed graphs ⋮ The diachromatic number of digraphs ⋮ Complete colourings of hypergraphs ⋮ Three algorithms for graph locally harmonious colouring

This page was built for publication: Harmonious chromatic number of directed graphs