Bi-Cohen-Macaulay graphs

  • Jürgen Herzog
  • Ahad Rahimi
DOI: https://doi.org/10.37236/5557
Keywords: Bi-Cohen-Macaulay, Bipartite and chordal graphs, Generic graphs, Inseparability

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.

Published
2016-01-11
How to Cite
Herzog, J., & Rahimi, A. (2016). Bi-Cohen-Macaulay graphs. The Electronic Journal of Combinatorics, 23(1), P1.1. https://doi.org/10.37236/5557
Issue
Volume 23, Issue 1 (2016)
Article Number
P1.1