Generalising the achromatic number to Zaslavsky's colourings of signed graphs

09/28/2021
by   Julien Bensmail, et al.
0

The chromatic number, which refers to the minimum number of colours required to colour the vertices of graphs properly, is one of the most central notions of the graph chromatic theory. Several of its aspects of interest have been investigated in the literature, including variants for modifications of proper colourings. These variants include, notably, the achromatic number of graphs, which is the maximum number of colours required to colour the vertices of graphs properly so that each possible combination of distinct colours is assigned along some edge. The behaviours of this parameter have led to many investigations of interest, bringing to light both similarities and discrepancies with the chromatic number. This work takes place in a recent trend aiming at extending the chromatic theory of graphs to the realm of signed graphs, and, in particular, at investigating how classic results adapt to the signed context. Most of the works done in that line to date are with respect to two main generalisations of proper colourings of signed graphs, attributed to Zaslavsky and Guenin. Generalising the achromatic number to signed graphs was initiated recently by Lajou, his investigations being related to Guenin's colourings. We here pursue this line of research, but with taking Zaslavsky's colourings as our notion of proper colourings. We study the general behaviour of our resulting variant of the achromatic number, mainly by investigating how known results on the classic achromatic number generalise to our context. Our results cover, notably, bounds, standard operations on graphs, and complexity aspects.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/16/2023

Sampling Proper Colorings on Line Graphs Using (1+o(1))Δ Colors

We prove that the single-site Glauber dynamics for sampling proper q-col...
research
01/12/2023

Computing m-Eternal Domination Number of Cactus Graphs in Linear Time

In m-eternal domination attacker and defender play on a graph. Initially...
research
12/21/2019

Complexity results for the proper disconnection of graphs

For an edge-colored graph G, a set F of edges of G is called a proper ed...
research
06/01/2021

Approximate and exact results for the harmonious chromatic number

Graph colorings is a fundamental topic in graph theory that require an a...
research
11/30/2020

On the proper orientation number of chordal graphs

An orientation D of a graph G=(V,E) is a digraph obtained from G by repl...
research
07/26/2023

Cliqueful graphs as a means of calculating the maximal number of maximum cliques of simple graphs

A simple graph on n vertices may contain a lot of maximum cliques. But h...

Please sign up or login with your details

Forgot password? Click here to reset