On the achromatic number of signed graphs

On the achromatic number of signed graphs

Theoretical Computer Science, Elsevier, 2019 In this paper, we generalize the concept of complete coloring and achromatic number to 2-edge-colored graphs and signed graphs. We give some useful relationships between different possible definitions of such achromatic numbers and prove that computing an...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Lajou, Dimitri
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Computational Complexity
Mathematics - Combinatorics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Theoretical Computer Science, Elsevier, 2019 In this paper, we generalize the concept of complete coloring and achromatic number to 2-edge-colored graphs and signed graphs. We give some useful relationships between different possible definitions of such achromatic numbers and prove that computing any of them is NP-complete.
DOI:10.48550/arxiv.1902.04828