{'fraction_non_alphanumeric': 0.02513747054202671, 'fraction_numerical': 0.002356637863315004, 'mean_word_length': 4.790909090909091, '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}}
Generating simple near‐bipartite bricks

A brick is a 3‐connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick G is near‐bipartite if it has a pair of edges α and β such that G−{α,β} is bipartite and matching covered; examples are K4 and the triangular prism C6¯ . The significance of near‐bipartite bricks arises from the theory of ear decompositions of matching covered graphs. The object of this paper is to establish a generation procedure which is specific to the class of simple near‐bipartite bricks. In particular, we prove that every simple near‐bipartite brick G has an edge e such that the graph obtained from G−e by contracting each edge that is incident with a vertex of degree two is also a simple near‐bipartite brick, unless G belongs to any of eight well‐defined infinite families. This is a refinement of the brick generation theorem of Norine and Thomas which is applicable to the class of near‐bipartite bricks. Earlier, the first author proved a similar generation theorem for (not necessarily simple) near‐bipartite bricks; we deduce our main result from this theorem. Our proof is based on a strategy of Carvalho, Lucchesi and Murty and uses several of their techniques and results.