Minimal path cover sets and monomial ideals
From MaRDI portal
Publication:5498570
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)
Recommendations
Cites work
Cited in
(7)- Minimal free resolution of monomial ideals by iterated mapping cone
- On the minimal path cover sets of union of certain graphs
- \(t\)-clique ideal and \(t\)-independence ideal of a graph
- The monomial ideal of independent sets associated to a graph
- \(q\)-paths of a graph and incidence matrix
- Persistence property for some classes of monomial ideals of a polynomial ring
- \(q\)-paths of a graph and incidence matrix. II
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)