Minimal path cover sets and monomial ideals
From MaRDI portal
Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of commutative algebra (05E40) Other special types of modules and ideals in commutative rings (13C13) Computational aspects and applications of commutative rings (13P99)
Recommendations
Cites work
Cited in
(8)- The monomial ideal of independent sets associated to a graph
- Minimal free resolution of monomial ideals by iterated mapping cone
- \(t\)-clique ideal and \(t\)-independence ideal of a graph
- q-paths of a graph and incidence matrix. II
- On the minimal path cover sets of union of certain graphs
- q-paths of a graph and incidence matrix
- Persistence property for some classes of monomial ideals of a polynomial ring
- t-closed neighborhood ideal of a graph
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)