Dumpy graph
From Egres Open
A rooted digraph is called k-dumpy if every non-root node has indegree k and every non-singleton set not containing the root has indegree at least k+1.
- This page was last modified on 5 December 2012, at 13:22.
