{'fraction_non_alphanumeric': 0.026385224274406333, 'fraction_numerical': 0.009234828496042216, 'mean_word_length': 4.580882352941177, '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}}
Labeled Bipartite Blocks

Graphs which are 2-connected have been called blocks in the graph theoretic literature [3] and stars in the parlance of statistical mechanics [1]. They are also called nonseparable graphs, and in this paper include the complete graph K2 on p = 2 points. The standard terminology of graphical enumeration can be found in [3]. When its points are colored using two distinct colors in such a way that adjacent points receive different colors, a graph is called 2-colored. If the colors are considered interchangeable, such a graph is called bicolored. A graph which can be bicolored is called bicolorable. It is obvious that a connected bicolorable graph has a unique bicoloring, and so one can speak of the sizes of its color classes.