No CrossRef data available.
Article contents
Regular Digraphs Containing a Given Digraph
Published online by Cambridge University Press: 20 November 2018
Abstract
Let the maximum degree d of a digraph D be the maximum of the set of all outdegrees and indegrees of the points of D. We prove that every digraph D of order P and maximum degree d has a d-regular superdigraph H with at most d + 1 more points, and that this bound, which is independent of p, is best possible.
Keywords
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1984