Minimal path cover sets and monomial ideals

DOI10.1142/S0219498815500140zbMath1306.05122WikidataQ58841455 ScholiaQ58841455MaRDI QIDQ5498570

Leila Sharifan, Kazem Khashyarmanesh, Mehrdad Nasernejad

Publication date: 9 February 2015

Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)

zbMATH Keywords

pathsmonomial ideals

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Computational aspects and applications of commutative rings (13P99) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Other special types of modules and ideals in commutative rings (13C13) Combinatorial aspects of commutative algebra (05E40)

Related Items

Minimal free resolution of monomial ideals by iterated mapping cone ⋮ On the minimal path cover sets of union of certain graphs ⋮ Persistence property for some classes of monomial ideals of a polynomial ring

Cites Work

• Path ideals of rooted trees and their graded Betti numbers
• \(M\)-sequences, graph ideals, and ladder ideals of linear type
• Cohen-Macaulay graphs
• Minimum \(k\)-path vertex cover
• Algebraic Properties of the Path Ideal of a Tree
• Monomial Ideals

This page was built for publication: Minimal path cover sets and monomial ideals