{'fraction_non_alphanumeric': 0.027867095391211148, 'fraction_numerical': 0.010718113612004287, 'mean_word_length': 4.66060606060606, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
On a graph labelling conjecture involving coloured labels

In this work, we investigate a recent conjecture by Baudon, Bensmail, Davot, Hocquard, Przybylo, Senhaji, Sopena and Woźniak, which states that graphs, in general, can be edge-labelled with red labels 1,2 and blue labels 1,2 so that every two adjacent vertices are distinguished accordingly to either the sums of their incident red labels or the sums of their incident blue labels. To date, this was verified for several classes of graphs. Also, it is known how to design several labelling schemes that are very close to what is desired. 
 
In this work, we adapt two important proofs of the field, leading to some progress towards that conjecture. We first prove that graphs can be labelled with red labels 1,2,3 and blue labels 1,2 so that every two adjacent vertices are distinguished as required. We then verify the conjecture for graphs with chromatic number at most 4.