10 citations · 10 across the 2 of their papers we have counts for
2 papers
math.CO2015★ 10 cited
On closed graphs II
David A. Cox, Andrew Erskine
A graph is closed when its vertices have a labeling by [n] with a certain property first discovered in the study of binomial edge ideals. In this article, we explore various aspect…
math.CO2013
On Closed Graphs I
David A. Cox, Andrew Erskine
A graph is closed when its vertices have a labeling by [n] with a certain property first discovered in the study of binomial edge ideals. In this article, we prove that a connected…