Prefer a chat interface with context about you and your work?
Achromatic number of fragmentable graphs
Abstract A complete coloring of a simple graph G is a proper vertex coloring such that each pair of colors appears together on at least one edge. The achromatic number ψ( G ) is the greatest number of colors in such a coloring. We say a class of graphs is …