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.
Building similarity graph...
Analyzing shared references across papers
Loading...
Raventino et al. (Thu,) studied this question.
www.synapsesocial.com/papers/68af4cdfad7bf08b1ead64fc — DOI: https://doi.org/10.22342/jims.v31i3.1710
Raventino Raventino
Yeni Susanti
Journal of the Indonesian Mathematical Society
Universitas Gadjah Mada
Building similarity graph...
Analyzing shared references across papers
Loading...