Achromatic number of collections of paths and cycles

作者：Edwards Keith J^*

来源：Discrete Mathematics, 2013, 313(19): 1856-1860.

DOI：10.1016/j.disc.2012.08.008

• Achromatic number
• Cycles
• Paths

A complete colouring of a simple graph G is a proper vertex colouring such that each pair of colours appears together on at least one edge. The achromatic number Psi(G) is the greatest number of colours in such a colouring. %26lt;br%26gt;We give simple necessary and sufficient conditions for a graph of maximum degree 2 to have a complete colouring with k colours, provided the graph is large enough, and use this to give the achromatic number for such a graph.

• 出版日期2013-10-6