Premium
Edge list multicoloring trees: An extension of Hall's theorem
Author(s) -
Cropper Mathew,
Gyárfás András,
Lehel Jenő
Publication year - 2003
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.10093
Subject(s) - mathematics , combinatorics , extension (predicate logic) , generalization , discrete mathematics , graph , enhanced data rates for gsm evolution , mathematical analysis , computer science , telecommunications , programming language
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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom