This paper exploits the remarkable new method of Galvin (J. Combin. Theory Ser. B 63 (1995), 153 158), who proved that the list edge chromatic number /$ list (G) of a bipartite multigraph G equals its edge chromatic number /$(G). It is now proved here that if every edge e=uw of a bipartite multigrap
Aspects of edge list-colourings
โ Scribed by A.J.W. Hilton; T. Slivnik; D.S.G. Stirling
- Book ID
- 108315570
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 125 KB
- Volume
- 231
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A graph G = G( V, E) is called L-list colourable if there is a vertex colouring of G in which the colour assigned to a vertex u is chosen from a list L(v) associated with this vertex. We say G is k-choosable if all lists L(u) have the cardinality k and G is L-list colourable for all possible assignm
A partial triple system of order v, PT(v), is a pair (V, B) where V is a v-set, and B is a collection of 3-subsets of V (called triples) such that each 2-subset of V is contained in at most one triple. A maximum partial triple system of order v, MPT(v), is a PT(v), (V, B), such that for any other PT