✦ LIBER ✦

Choosability of Powers of Circuits

✍ Scribed by Anton Prowse; Douglas R. Woodall

Publisher: Springer Japan
Year: 2003
Tongue: English
Weight: 132 KB
Volume: 19
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-002-0486-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Choosability, Edge Choosability, and Tot

Choosability, Edge Choosability, and Total Choosability of Outerplane Graphs

✍ Wang Weifan; Ko-Wei Lih 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 101 KB

Let χ l (G), χ l (G), χ l (G), and (G) denote, respectively, the list chromatic number, the list chromatic index, the list total chromatic number, and the maximum degree of a non-trivial connected outerplane graph G. We prove the following results. ( 1 and only if G is an odd cycle. This proves the

On the eigenvalues of distance powers of

On the eigenvalues of distance powers of circuits

✍ J.W. Sander; T. Sander 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 166 KB

Circular consecutive choosability of k-c

Circular consecutive choosability of k-choosable graphs

✍ Daphne Liu,; Serguei Norine,; Zhishi Pan;; Xuding Zhu 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB

Let S(r ) denote a circle of circumference r. The circular consecutive choosability ch cc (G) of a graph G is the least real number t such that

Choosability and edge choosability of pl

Choosability and edge choosability of planar graphs without five cycles

✍ Weifan Wang; Ko-Wei Lih 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 402 KB

## It is proved that a planar graph G without five cycles is three degenerate, hence, four choosable, and it is also edge-(A( G) + l)-h

Weight choosability of graphs

✍ Tomasz Bartnicki; Jarosław Grytczuk; Stanisław Niwczyk 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB

## Abstract Suppose the edges of a graph __G__ are assigned 3‐element lists of real weights. Is it possible to choose a weight for each edge from its list so that the sums of weights around adjacent vertices were different? We prove that the answer is positive for several classes of graphs, includi

Circular choosability of graphs

✍ Xuding Zhu 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB

This paper discusses the circular version of list coloring of graphs. We give two definitions of the circular list chromatic number (or circular choosability) c;l ðGÞ of a graph G and prove that they are equivalent. Then we prove that for any graph G, c;l ðGÞ ! l ðGÞ À 1. Examples are given to show