On $(3,1)^*$-Coloring of Plane Graphs
โ Scribed by Xu, Baogang
- Book ID
- 118196949
- Publisher
- Society for Industrial and Applied Mathematics
- Year
- 2009
- Tongue
- English
- Weight
- 526 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0895-4801
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Borodin, O.V., Cyclic coloring of plane graphs, Discrete Mathematics 100 (1992) 281-289. Let G be a plane graph, and let x,(G) be the minimum number of colors to color the vertices of G so that every two of them which lie in the boundary of the same face of the size at most k, receive different colo
## Abstract We show that every plane graph with maximum face size four in which all faces of size four are vertexโdisjoint is cyclically 5โcolorable. This answers a question of Albertson whether graphs drawn in the plane with all crossings independent are 5โcolorable. ยฉ 2009 Wiley Periodicals, Inc.