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

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


3-Facial Coloring of Plane Graphs
โœ Havet, Frรฉdรฉric; Sereni, Jean-Sรฉbastien; ล krekovski, Riste ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 245 KB
On 3-colorings of Plane Graphs
โœ Bao-gang Xu ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Institute of Applied Mathematics, Chinese Academy ๐ŸŒ English โš– 162 KB
Cyclic coloring of plane graphs
โœ Oleg V. Borodin ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 637 KB

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

Coloring plane graphs with independent c
โœ Daniel Krรกl'; Ladislav Stacho ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 268 KB

## 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.

Oriented 5-coloring of sparse plane grap
โœ O. V. Borodin; A. O. Ivanova; A. V. Kostochka ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Pleiades Publishing ๐ŸŒ English โš– 506 KB