Edge ideals of oriented graphs
2019
Let 𝒟 be a weighted oriented graph and let I(𝒟) be its edge ideal. Under a natural condition that the underlying (undirected) graph of 𝒟 contains a perfect matching consisting of leaves, we provide...
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
14
References
21
Citations
NaN
KQI