arXiv · 2310.17343
Cohen-Macaulay permutation graphs
Abstract
In this article, we characterize Cohen-Macaulay permutation graphs. In particular, we show that a permutation graph is Cohen-Macaulay if and only if it is well-covered and there exists a unique way of partitioning its vertex set into $r$ disjoint maximal cliques, where $r$ is the cardinality of a maximal independent set of the graph. We also provide some sufficient conditions for a comparability graph to be a uniquely partially orderable (UPO) graph.
Explore related subjects
Keep this discovery
P. V. Cheri, Deblina Dey, Akhil K, Nirmal Kotal, Dharm Veer. 2023-10-26. Cohen-Macaulay permutation graphs. https://doi.org/10.7146/math.scand.a-149033
Cite the original work for its findings. Save a collection to share your selection of sources.