2000 character limit reached
A Characterization of Gorenstein Planar graphs
Published 1 Mar 2016 in math.AC and math.CO | (1603.00326v2)
Abstract: We prove that a planar graph is Gorenstein if and only if its independence complex is Eulerian.
Paper Prompts
Sign up for free to create and run prompts on this paper.