Circular consecutive choosability of k-choosable graphs

機構典藏 > College of Sciences > Department of Applied Mathematics and Data Science > Journal Article > Item 987654321/56754

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/56754

Title:	Circular consecutive choosability of k-choosable graphs
Authors:	Liu, Daphne;Serguei Norine;Pan, Zhishi;Zhu, Xuding
Contributors:	淡江大學數學學系
Keywords:	Choosability;Circular consecutive choosability
Date:	2011-07
Issue Date:	2011-09-07 12:01:02 (UTC+8)
Publisher:	Hoboken: John Wiley & Sons, Inc.
Abstract:	Let S(r) denote a circle of circumference r. The circular consecutive choosability chcc(G) of a graph G is the least real number t such that for any r≥χc(G), if each vertex v is assigned a closed interval L(v) of length t on S(r), then there is a circular r-coloring f of G such that f(v)∈L(v). We investigate, for a graph, the relations between its circular consecutive choosability and choosability. It is proved that for any positive integer k, if a graph G is k-choosable, then chcc(G)≦k + 1 − 1/k; moreover, the bound is sharp for k≥3. For k = 2, it is proved that if G is 2-choosable then chcc(G)≦2, while the equality holds if and only if G contains a cycle. In addition, we prove that there exist circular consecutive 2-choosable graphs which are not 2-choosable. In particular, it is shown that chcc(G) = 2 holds for all cycles and for K2, n with n≥2. On the other hand, we prove that chcc(G)＞2 holds for many generalized theta graphs.
Relation:	Journal of Graph Theory 67(3), pp.178-197
DOI:	10.1002/jgt.20524
Appears in Collections:	[Department of Applied Mathematics and Data Science] Journal Article

Files in This Item:

File	Size	Format
	0Kb	HTML	357	View/Open
11 Circular Consecutive Choosability of k-Choosable Graphs.pdf	190Kb	Adobe PDF	668	View/Open
Circular consecutive choosability of k-choosable graphs.pdf	190Kb	Adobe PDF	1	View/Open
index.html	0Kb	HTML	252	View/Open