{'fraction_non_alphanumeric': 0.02358490566037736, 'fraction_numerical': 0.0031446540880503146, 'mean_word_length': 4.953271028037383, '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}}
DECOMPOSITION OF COMPLETE BIPARTITE DIGRAPHS AND EVEN COMPLETE BIPARTITE MULTIGRAPHS INTO CLOSED TRAILS

It has been shown [3] that any bipartite graph Ka,b, where a, b are even integers, can be decomposed into closed trails with prescribed even lengths. In this article, we consider the corresponding question for directed bipartite graphs. We show that a complete directed bipartite graph ←→ K a,b is decomposable into directed closed trails of even lengths greater than 2, whenever these lengths sum up to the size of the digraph. We use this result to prove that complete bipartite multigraphs can be decomposed in a similar manner.