✦ LIBER ✦

Improved bounds on linear coloring of plane graphs

✍ Scribed by Wei Dong; BaoGang Xu; XiaoYan Zhang

Book ID: 107348183
Publisher: SP Science China Press
Year: 2010
Tongue: English
Weight: 180 KB
Volume: 53
Category: Article
ISSN: 1674-7283
DOI: 10.1007/s11425-010-3073-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved bounds on coloring of graphs

✍ Sokol Ndreca; Aldo Procacci; Benedetto Scoppola 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 280 KB

New upper bounds on linear coloring of p

New upper bounds on linear coloring of planar graphs

✍ Bin Liu, Gui Zhen Liu 📂 Article 📅 2011 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 199 KB

On $(3,1)^*$-Coloring of Plane Graphs

✍ Xu, Baogang 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 526 KB

Polychromatic colorings of bounded degre

Polychromatic colorings of bounded degree plane graphs

✍ Elad Horev; Roi Krakovski 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 289 KB

## Abstract A __polychromatic k__‐__coloring__ of a plane graph __G__ is an assignment of __k__ colors to the vertices of __G__ such that every face of __G__ has __all k__ colors on its boundary. For a given plane graph __G__, one seeks the __maximum__ number __k__ such that __G__ admits a polychro

Linear coloring of graphs

✍ Raphael Yuster 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 213 KB

A proper vertex coloring of a graph is called linear if the subgraph induced by the vertices colored by any two colors is a set of vertex-disjoint paths. The linear chromatic number of a graph G, denoted by lc(G), is the minimum number of colors in a linear coloring of G. Extending a result of Alon,

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