Minimal path cover sets and monomial ideals
DOI10.1142/S0219498815500140zbMATH Open1306.05122WikidataQ58841455 ScholiaQ58841455MaRDI QIDQ5498570FDOQ5498570
Authors: Leila Sharifan, K. Khashyarmanesh, Mehrdad Nasernejad
Publication date: 9 February 2015
Published in: Journal of Algebra and its Applications (Search for Journal in Brave)
Recommendations
Trees (05C05) Extremal problems in graph theory (05C35) Combinatorial aspects of commutative algebra (05E40) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Other special types of modules and ideals in commutative rings (13C13) Computational aspects and applications of commutative rings (13P99)
Cites Work
Cited In (7)
- Minimal free resolution of monomial ideals by iterated mapping cone
- The monomial ideal of independent sets associated to a graph
- On the minimal path cover sets of union of certain graphs
- \(q\)-paths of a graph and incidence matrix. II
- \(t\)-clique ideal and \(t\)-independence ideal of a graph
- Persistence property for some classes of monomial ideals of a polynomial ring
- \(q\)-paths of a graph and incidence matrix
This page was built for publication: Minimal path cover sets and monomial ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5498570)