An algorithm for an ๐<sup>2</sup>-homological test for the planarity of a graph
An algorithm for an ๐<sup>2</sup>-homological test for the planarity of a graph
Given a finite simple graph ฮ, one is able to define the presentation of an associate Coxeter group W(ฮ) and construct a CW-complex on which the associated Coxeter group acts. The space is the so-called Davis Complex, denoted ฮฃ(ฮ), and the given graph carries much of the local topological information โฆ