Dumpy graph

From Egres Open
Jump to: navigation, search

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.