{'fraction_non_alphanumeric': 0.03248259860788863, 'fraction_numerical': 0.027842227378190254, 'mean_word_length': 5.084507042253521, '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}}
– Graph Theory 15 ( 1995 ) 19 – 31 19 ON CHROMATICITY OF GRAPHS

Abstract In this paper we obtain the explicit formulas for chromatic polynomials of cacti. From the results relating to cacti we deduce the analogous formulas for the chromatic polynomials of n–gon–trees. Besides, we characterize unicyclic graphs by their chromatic polynomials. We also show that the so–called clique–forest–like graphs are chromatically equivalent.