𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Total Colorings of Planar Graphs without Small Cycles

✍ Scribed by Jianfeng Hou; Yan Zhu; Guizhen Liu; Jianliang Wu; Mei Lan

Publisher
Springer Japan
Year
2008
Tongue
English
Weight
197 KB
Volume
24
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Planar graph colorings without short mon
Planar graph colorings without short monochromatic cycles
✍ TomΓ‘Ε‘ Kaiser; Riste Ε krekovski πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 126 KB πŸ‘ 1 views

## Abstract It is well known that every planar graph __G__ is 2‐colorable in such a way that no 3‐cycle of __G__ is monochromatic. In this paper, we prove that __G__ has a 2‐coloring such that no cycle of length 3 or 4 is monochromatic. The complete graph __K__~5~ does not admit such a coloring. On

Acyclic 5-choosability of planar graphs
Acyclic 5-choosability of planar graphs without small cycles
✍ MickaΓ«l Montassier; AndrΓ© Raspaud; Weifan Wang πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 188 KB πŸ‘ 1 views

## Abstract A proper vertex coloring of a graph __G__ = (__V,E__) is acyclic if __G__ contains no bicolored cycle. A graph __G__ is acyclically __L__‐list colorable if for a given list assignment __L__ = {__L__(__v__): __v__:β€‰βˆˆβ€‰__V__}, there exists a proper acyclic coloring ϕ of __G__ such that Ο•(_