{'fraction_non_alphanumeric': 0.029250457038391225, 'fraction_numerical': 0.007312614259597806, 'mean_word_length': 4.5353535353535355, '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 viruses in graphs and digraphs Virus en grafos y digrafos

A virus is a local configuration that, if present in a graph or a digraph, forbids these graphs or digraphs to have a specific property. The aim of this article is to sketch the evolution of the virus theory from its birth in 1991. Moreover some new results and open questions are given. The properties with its known viruses, that will be discussed in this work, are the following: hamiltonian, traceable, k-connected, k-edge-connected, strongly connected and have a perfect matching.