𝔖 Bobbio Scriptorium
✦   LIBER   ✦

\((1,0,0)\)-Colorability of planar graphs without prescribed short cycles

✍ Scribed by Bu, Yuehua; Xu, Jinghan; Wang, Yingqian

Book ID
121625765
Publisher
Springer US
Year
2013
Tongue
English
Weight
448 KB
Volume
30
Category
Article
ISSN
1382-6905

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