Edge list multicoloring trees: An extension of Hall's theorem

We prove a necessary and sufficient condition for the existence of edge list multicoloring of trees. The result extends the Halmos–Vaughan generalization of Hall's theorem on the existence of distinct representatives of sets. © 2003 Wiley Periodicals, Inc. J Graph Theory 42: 246–255, 2003

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of graph theory 2003-03, Vol.42 (3), p.246-255
Hauptverfasser:	Cropper, Mathew, Gyárfás, András, Lehel, Jenő
Format:	Artikel
Sprache:	eng
Schlagworte:	edge and vertex of multicolorings Hall's theorem list-coloring of graphs transversal (matching) theory trees
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	We prove a necessary and sufficient condition for the existence of edge list multicoloring of trees. The result extends the Halmos–Vaughan generalization of Hall's theorem on the existence of distinct representatives of sets. © 2003 Wiley Periodicals, Inc. J Graph Theory 42: 246–255, 2003
ISSN:	0364-9024 1097-0118
DOI:	10.1002/jgt.10093