𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on entire choosability of plane graphs

✍ Scribed by Wei Dong

Book ID
113564756
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
199 KB
Volume
160
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Coupled choosability of plane graphs
Coupled choosability of plane graphs
✍ Weifan Wang; Ko-Wei Lih πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 197 KB

## Abstract A plane graph __G__ is coupled __k__‐choosable if, for any list assignment __L__ satisfying $|{{L}}({{x}})|= {{k}}$ for every ${{x}}\in {{V}}({{G}})\cup {{F}}({{G}})$, there is a coloring that assigns to each vertex and each face a color from its list such that any two adjacent or incid

Entire colouring of plane graphs
Entire colouring of plane graphs
✍ Weifan Wang; Xuding Zhu πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 210 KB
On Structure of Some Plane Graphs with A
On Structure of Some Plane Graphs with Application to Choosability
✍ Peter Che Bor Lam; Wai Chee Shiu; Baogang Xu πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 180 KB

A graph G=(V, E) is (x, y)-choosable for integers x> y 1 if for any given family In this paper, structures of some plane graphs, including plane graphs with minimum degree 4, are studied. Using these results, we may show that if G is free of k-cycles for some k # [3,4,5,6], or if any two triangles