Diachromatic Number of Some Acyclic Digraphs

Key Points

• The maximum number of colors needed for complete coloring in specific acyclic digraphs varies significantly.
• This study addresses diachromatic numbers across four types of digraphs—lobster, fireworks, banana tree, and coconut tree digraphs.
• The analysis involves both specified and arbitrary directional orientations of the digraphs.
• Understanding these characteristics may inform broader applications in graph theory and related fields.

Abstract