Bi-Cohen-Macaulay graphs (Q907246)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6534984
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bi-Cohen-Macaulay graphs |
scientific article; zbMATH DE number 6534984 |
Statements
Bi-Cohen-Macaulay graphs (English)
0 references
25 January 2016
0 references
Summary: 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.
0 references
bi-Cohen-Macaulay
0 references
bipartite and chordal graphs
0 references
generic graphs
0 references
inseparability
0 references
0 references
0.9428153
0 references
0.93009293
0 references
0 references
0 references
0 references
0 references
0.90433043
0 references
0 references
