Cohen-Macaulay permutation graphs

DOI10.7146/MATH.SCAND.A-149033MaRDI QIDQ7036489zbMATH OpenFDO

Authors P. V. Cheri, Deblina Dey, Akhil K, Nirmal Kotal, Dharm Veer

Publication date 28 January 2025

Published in Mathematica Scandinavica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7146/MATH.SCAND.A-149033

zbMATH Keywords

comparability graphswell-covered graphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Structural characterization of families of graphs (05C75) Graph theory (05C99) Partial orders, general (06A06) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55)

Cites work

• A translation of Gallai's paper: `Transitiv orientierbare Graphen'
• Almost all comparability graphs are UPO
• Cohen--Macaulay chordal graphs
• Cohen-Macaulay edge ideal whose height is half of the number of vertices
• Cohen-Macaulay graphs
• Cohen-Macaulay, shellable and unmixed clutters with a perfect matching of König type
• Comparability graphs and intersection graphs
• Distributive lattices, bipartite graphs and Alexander duality
• scientific article; zbMATH DE number 2236739 (Why is no real title available?)
• Line graphs and line digraphs
• Partially Ordered Sets
• Permutation Graphs and Transitive Graphs
• The Dimension of a Comparability Graph
• Transitiv orientierbare Graphen
• Transitive Orientation of Graphs and Identification of Permutation Graphs

Cited in

(1)

• On Cohen-Macaulay posets of dimension two and permutation graphs

This page was built for publication: Cohen-Macaulay permutation graphs

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