@book{772530259faa4adf8be07a29e4be40f1,

title = "A vizing-type theorem for matching forests",

abstract = "A well known Theorem of Vizing states that one can colour the edges of a graph by $\Delta +\alpha$ colours, such that edges of the same colour form a matching. Here, $\Delta$ denotes the maximum degree of a vertex, and $\alpha$ the maximum multiplicity of an edge in the graph. An analogue of this Theorem for directed graphs was proved by Frank. It states that one can colour the arcs of a digraph by $\Delta +\alpha$ colours, such that arcs of the same colour form a branching. For a digraph, $\Delta$ denotes the maximum indegree of a vertex, and $\alpha$ the maximum multiplicity of an arc.",

keywords = "MSC-05C70, IR-65705, MSC-05C15, EWI-3337",

author = "J.C.M. Keijsper",

note = "Imported from MEMORANDA",

year = "2000",

language = "Undefined",

publisher = "University of Twente, Department of Applied Mathematics",

number = "1517",

}