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

Some results on list T-colourings

โœ Scribed by Adrian O. Waller


Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
271 KB
Volume
174
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis


In this paper we will give some results on list T-colorings. In particular we will give a lower bound for the T-choice number of even cycles with the set T = {0, 1,2 ..... r}, r ~> 1, and give the value of the T-choice number for the even cycles C4, and C2n where n>~r.


๐Ÿ“œ SIMILAR VOLUMES


A Vertex-Splitting Lemma, de Werra's The
โœ A.J.W. Hilton; D.S.G. Stirling; T. Slivnik ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 418 KB

We prove a new vertex-splitting lemma which states that if a multigraph G has maximum multiplicity of at most p, then each vertex u can be split into W(d(u)ร‚p)X new vertices, w(d(u)ร‚p)x of degree p, with the multiple edges being shared out between the new vertices in such a way that each multiple ed

Some results on gaps
โœ Zoran Spasojeviฤ‡ ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 776 KB
Some observations on skip-lists
โœ Sandeep Sen ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 520 KB