Bi-Cohen-Macaulay graphs (Q907246): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Importer (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1508.07119 / rank
 
Normal rank

Latest revision as of 18:53, 18 April 2024

scientific article
Language Label Description Also known as
English
Bi-Cohen-Macaulay graphs
scientific article

    Statements

    Bi-Cohen-Macaulay graphs (English)
    0 references
    0 references
    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
    0 references
    bi-Cohen-Macaulay
    0 references
    bipartite and chordal graphs
    0 references
    generic graphs
    0 references
    inseparability
    0 references
    0 references