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.
@article{10_37236_5557,
author = {J\"urgen Herzog and Ahad Rahimi},
title = {Bi-Cohen-Macaulay graphs},
journal = {The electronic journal of combinatorics},
year = {2016},
volume = {23},
number = {1},
doi = {10.37236/5557},
zbl = {1329.05316},
url = {http://geodesic.mathdoc.fr/articles/10.37236/5557/}
}
TY - JOUR
AU - Jürgen Herzog
AU - Ahad Rahimi
TI - Bi-Cohen-Macaulay graphs
JO - The electronic journal of combinatorics
PY - 2016
VL - 23
IS - 1
UR - http://geodesic.mathdoc.fr/articles/10.37236/5557/
DO - 10.37236/5557
ID - 10_37236_5557
ER -
%0 Journal Article
%A Jürgen Herzog
%A Ahad Rahimi
%T Bi-Cohen-Macaulay graphs
%J The electronic journal of combinatorics
%D 2016
%V 23
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/5557/
%R 10.37236/5557
%F 10_37236_5557
Jürgen Herzog; Ahad Rahimi. Bi-Cohen-Macaulay graphs. The electronic journal of combinatorics, Tome 23 (2016) no. 1. doi: 10.37236/5557