Cohen-Macaulayness of bipartite graphs, revisited

From MaRDI portal
Publication:745944

DOI10.1007/S40840-014-0100-2zbMATH Open1327.13078arXiv1012.0457OpenAlexW2100306204MaRDI QIDQ745944FDOQ745944


Authors: Rashid Zaare-Nahandi Edit this on Wikidata


Publication date: 15 October 2015

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Abstract: Cohen-Macaulayness of bipartite graphs is investigated by several mathematicians and has been characterized combinatorially. In this note, we give some different combinatorial conditions for a bipartite graph which are equal to Cohen-Macaulayness of the graphs. Conditions in the previous works are depending on an appropriate ordering on vertices of the graph. The conditions presented in this paper are not depending to any ordering. Finally, we present a fast algorithm to check Cohen-Macaulayness of a given bipartite graph.


Full work available at URL: https://arxiv.org/abs/1012.0457




Recommendations




Cites Work


Cited In (6)





This page was built for publication: Cohen-Macaulayness of bipartite graphs, revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q745944)