Year: 2024
Type: article
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.
Source: MATHEMATICA SCANDINAVICA
Authors: P. V. Cheri, Deblina Dey, Akhil K, Nirmal Kotal, Dharm Veer
Language: English
Subfield: Algebra and Number Theory
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Funders: Infosys Foundation, Sabancı Üniversitesi
OpenAlex ID: W4404026935