Papers
Topics
Authors
Recent
Search
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.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.