AI Chat AI Image Generator AI Video Text to Speech

On the achromatic number of signed graphs

02/13/2019

∙

by Dimitri Lajou, et al.

∙

∙

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.

page 1

page 2

page 3

page 4

research

∙ 04/16/2021

Complexity and algorithms for injective edge-coloring in graphs

An injective k-edge-coloring of a graph G is an assignment of colors, i....

0 Florent Foucaud, et al. ∙

research

∙ 09/02/2017

Complexity of Domination in Triangulated Plane Graphs

We prove that for a triangulated plane graph it is NP-complete to determ...

0 Dömötör Pálvölgyi, et al. ∙

research

∙ 02/08/2022

Defective incidence coloring of graphs

We define the d-defective incidence chromatic number of a graph, general...

0 Huimin Bi, et al. ∙

research

∙ 05/31/2019

More on Numbers and Graphs

In this note we revisit a "ring of graphs" Q in which the set of finite ...

0 Oliver Knill, et al. ∙

research

∙ 03/13/2023

Complexity and equivalency of multiset dimension and ID-colorings

This investigation is firstly focused into showing that two metric param...

0 Anni Hakanen, et al. ∙

research

∙ 06/28/2019

Complexity of acyclic colorings of graphs and digraphs with degree and girth constraints

We consider acyclic r-colorings in graphs and digraphs: they color the v...

0 Pavol Hell, et al. ∙

research

∙ 06/18/2020

Local structure of idempotent algebras II

In this paper we continue the study of edge-colored graphs associated wi...

0 Andrei A. Bulatov, et al. ∙