Back to Search Start Over

On the achromatic number of signed graphs.

Authors :
Lajou, Dimitri
Source :
Theoretical Computer Science. Feb2019, Vol. 759, p50-60. 11p.
Publication Year :
2019

Abstract

Abstract 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. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
03043975
Volume :
759
Database :
Academic Search Index
Journal :
Theoretical Computer Science
Publication Type :
Academic Journal
Accession number :
134149535
Full Text :
https://doi.org/10.1016/j.tcs.2019.01.006