๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


List Edge and List Total Colourings of M
โœ O.V. Borodin; A.V. Kostochka; D.R. Woodall ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 425 KB

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

List-colourings of graphs
โœ B. Bollobรกs; A. J. Harris ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Springer Japan ๐ŸŒ English โš– 597 KB
List colourings of planar graphs
โœ Margit Voigt ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 259 KB

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

Distance edge-colourings and matchings
โœ Ross J. Kang; Putra Manggala ๐Ÿ“‚ Article ๐Ÿ“… 2012 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 227 KB
Partial triple systems and edge colourin
โœ Alan Hartman ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 715 KB

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