A Vizing-type theorem for matching forests

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

3 Citaten (Scopus)

Samenvatting

A well-known Theorem of Vizing states that one can colour the edges of a graph by Δ + α colours, such that edges of the same colour form a matching. Here, Δ denotes the maximum degree of a vertex, and α 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 Δ + α colours, such that arcs of the same colour form a branching. For a digraph, A denotes the maximum indegree of a vertex, and a the maximum multiplicity of an arc. We prove a common generalization of the above two theorems concerning the colouring of mixed graphs (these are graphs having both directed and undirected edges) in such a way that edges of the same colour form a matching forest.

Originele taal-2Engels
Pagina's (van-tot)211-216
Aantal pagina's6
TijdschriftDiscrete Mathematics
Volume260
Nummer van het tijdschrift1-3
DOI's
StatusGepubliceerd - 6 jan 2003

Vingerafdruk

Duik in de onderzoeksthema's van 'A Vizing-type theorem for matching forests'. Samen vormen ze een unieke vingerafdruk.

Citeer dit