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

Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles

โœ Scribed by Wang, Wei-Fan; Lih, Ko-Wei

Book ID
118197196
Publisher
Society for Industrial and Applied Mathematics
Year
2002
Tongue
English
Weight
140 KB
Volume
15
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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