2000 character limit reached
Bi-Cohen-Macaulay graphs
Published 28 Aug 2015 in math.AC and math.CO | (1508.07119v1)
Abstract: In this paper we consider bi-Cohen-Macaulay graphs, and give a complete classification of such graphs in the case they are bipartite or chordal. General bi-Cohen-Macaulay graphs are classified up to separation. The inseparable bi-Cohen-Macaulay graphs are determined. We establish a bijection between the set of all trees and the set of inseparable bi-Cohen-Macaulay graphs.
Paper Prompts
Sign up for free to create and run prompts on this paper.