𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Coloring Vertices and Faces of Locally Planar Graphs

✍ Scribed by Michael O. Albertson; Bojan Mohar

Book ID
106047599
Publisher
Springer Japan
Year
2006
Tongue
English
Weight
102 KB
Volume
22
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Extending colorings of locally planar gr
Extending colorings of locally planar graphs
✍ Michael O. Albertson; Joan P. Hutchinson πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 112 KB πŸ‘ 1 views

Suppose G is a graph embedded in S g with width (also known as edge width) at least 264(2 g Γ€ 1). If P V(G) is such that the distance between any two vertices in P is at least 16, then any 5-coloring of P extends to a 5-coloring of all of G. We present similar extension theorems for 6-and 7-chromati

Coloring Powers of Planar Graphs
Coloring Powers of Planar Graphs
✍ Agnarsson, Geir; HalldΓ³rsson, MagnΓΊs M. πŸ“‚ Article πŸ“… 2003 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 183 KB
Star coloring bipartite planar graphs
Star coloring bipartite planar graphs
✍ H. A. Kierstead; AndrΓ© KΓΌndgen; Craig Timmons πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 139 KB

## Abstract A __star coloring__ of a graph is a proper vertex‐coloring such that no path on four vertices is 2‐colored. We prove that the vertices of every bipartite planar graph can be star colored from lists of size 14, and we give an example of a bipartite planar graph that requires at least eig