Year: 2025
Type: article
Abstract: A vertex coloring that ensures every pair of different colors is represented at least once is termed complete coloring. The diachromatic number of an acyclic digraph denotes the maximum number of colors required for its complete coloring. This study delves into the diachromatic numbers of lobster digraphs, fireworks digraphs, banana tree digraphs, and coconut tree digraphs under specific and arbitrary directional orientations.
Authors: Raventino Raventino, Yeni Susanti
Institution: Universitas Gadjah Mada
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4413348362